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 LM |
85 | for (i = 0; i < root->nbops; i++) { |
86 | if ((root->ops[i] != NULL) && (root->ops[i] != ERROR_OP)) { | |
87 | delelement (root->ops[i]); | |
88 | } | |
89 | } | |
0c95a3d3 LM |
90 | if (root->nbops) { |
91 | free (root->ops); | |
92 | } | |
031d7bba LM |
93 | free (root); |
94 | } | |
95 | } | |
96 | ||
2a688642 LM |
97 | /* duplicate element */ |
98 | ||
99 | element_t *dupelement (element_t *root) | |
100 | { | |
101 | element_t *tmp = NULL; | |
102 | int i; | |
103 | ||
104 | if ((root == NULL) || (root == ERROR_OP)) { | |
105 | return root; | |
106 | } | |
107 | tmp = newelement (root->func, root->nbops, root->prio); | |
2a688642 LM |
108 | tmp->value = root->value; |
109 | for (i = 0; i < root->nbops; i++) { | |
110 | tmp->ops[i] = dupelement (root->ops[i]); | |
2a688642 LM |
111 | } |
112 | return tmp; | |
113 | } | |
114 | ||
bc97a989 LM |
115 | /* functions */ |
116 | ||
ca3e2a2f | 117 | #define NB_OPERATORS 14 |
bc97a989 | 118 | keyword_t operators[NB_OPERATORS] = { |
11cda8d7 LM |
119 | { "+\t", Add, 2, 1, 1}, |
120 | { "-\t", Sub, 2, 1, 1}, | |
121 | { "*", Mul, 2, 1, 2}, | |
122 | { "/", Div, 2, 1, 2}, | |
c47a9298 | 123 | { "%", Mod, 2, 1, 3}, |
7fe742c9 | 124 | { "^", Pow, 2, 1, 4}, |
ca3e2a2f LM |
125 | { "==", Equal, 2, 2, -1}, |
126 | { "!=", Diff, 2, 2, -1}, | |
127 | { ">=", Ge, 2, 2, -1}, | |
128 | { "<=", Le, 2, 2, -1}, | |
129 | { ">", Gt, 2, 1, -1}, | |
130 | { "<", Lt, 2, 1, -1}, | |
131 | { "&", And, 2, 1, -2}, | |
132 | { "|", Or, 2, 1, -2} | |
bc97a989 LM |
133 | }; |
134 | ||
c7cbb833 | 135 | #define NB_FUNCTIONS 31 |
bc97a989 | 136 | keyword_t functions[NB_FUNCTIONS] = { |
c47a9298 LM |
137 | { "sqrt", Sqr, 1, 4, 5}, |
138 | { "pow", Pow, 2, 3, 5}, | |
139 | { "cos", Cos, 1, 3, 5}, | |
140 | { "sin", Sin, 1, 3, 5}, | |
9e52bbc5 LM |
141 | { "tan", Tan, 1, 3, 5}, |
142 | { "acos", Acos, 1, 4, 5}, | |
143 | { "asin", Asin, 1, 4, 5}, | |
471da7c9 | 144 | { "atan", Atan, 1, 4, 5}, |
89cf0955 | 145 | { "log", Log, 1, 3, 5}, |
9e52bbc5 LM |
146 | { "exp", Exp, 1, 3, 5}, |
147 | { "abs", Abs, 1, 3, 5}, | |
148 | { "floor", Floor, 1, 5, 5}, | |
149 | { "ceil", Ceil, 1, 4, 5}, | |
2a688642 | 150 | { "sto", Store, 2, 3, 5}, |
6ba1dd0f | 151 | { "rcl", Recall, 1, 3, 5}, |
a8cf32ba LM |
152 | { "inc", Inc, 1, 3, 5}, |
153 | { "dec", Dec, 1, 3, 5}, | |
ca3e2a2f | 154 | { "disp", Disp, 0, 4, 9}, |
f438579a | 155 | { "mem", Mem, 1, 3, 9}, |
143f91ae | 156 | { "clr", Clear, 0, 3, 9}, |
ca3e2a2f LM |
157 | { "quit", Quit, 0, 4, 9}, |
158 | { "help", Help, 0, 4, 9}, | |
94b4e517 | 159 | { "!", Not, 1, 1, 6}, |
2a688642 | 160 | { "cond", Cond, 3, 4, 5}, |
715580ff | 161 | { "while", While, 2, 5, 5}, |
c7cbb833 LM |
162 | { "print", Print, 1, 5, 5}, |
163 | { "prog", Prog, 3, 4, 9}, | |
164 | { "call", Call, 10, 4, 5}, | |
165 | { "ls", List, 0, 2, 9}, | |
166 | { "edit", Edit, 1, 4, 9}, | |
167 | { "del", Del, 1, 3, 9} | |
471da7c9 LM |
168 | }; |
169 | ||
5075f6ea | 170 | #define NB_CONSTANTS 3 |
471da7c9 | 171 | keyword_t constants[NB_CONSTANTS] = { |
5075f6ea LM |
172 | { "ans", Ans, 0, 3, 5}, |
173 | { "e", E, 0, 1, 5}, | |
174 | { "pi", Pi, 0, 2, 5} | |
bc97a989 LM |
175 | }; |
176 | ||
db660e60 LM |
177 | #define NB_SYMBOLS 4 |
178 | char *symbols[NB_SYMBOLS] = { | |
179 | "(", ")", "{", "}" | |
180 | }; | |
181 | ||
d2ff8478 LM |
182 | /* subparser function */ |
183 | ||
184 | element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio) | |
185 | { | |
186 | element_t *new = newelement (func, nbops, prio); | |
d2ff8478 LM |
187 | new->ops[0] = *proot; |
188 | new->ops[1] = parser (*pstr, pstr, new->prio); | |
686c4bc2 | 189 | if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) { |
67b13e3d LM |
190 | delelement (new->ops[1]); |
191 | new->ops[1] = ERROR_OP; | |
192 | } | |
d2ff8478 | 193 | if (new->ops[1] == ERROR_OP) { |
031d7bba LM |
194 | delelement (new); |
195 | *proot = NULL; | |
d2ff8478 LM |
196 | return ERROR_OP; |
197 | } | |
3b4b0bbe | 198 | *proot = newelement (Val, 1, 5); |
d2ff8478 LM |
199 | (*proot)->ops[0] = new; |
200 | ||
201 | return *proot; | |
202 | } | |
203 | ||
bc97a989 LM |
204 | /* parser function */ |
205 | ||
ef37d966 | 206 | element_t *parser (char *str, char **next, int prio) |
0b489a77 | 207 | { |
bc97a989 | 208 | element_t *root = NULL; |
779282bb | 209 | char *string = str; |
85b4a72c | 210 | int i; |
bc97a989 | 211 | |
04d68907 | 212 | VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n")); |
49223129 | 213 | |
bc97a989 LM |
214 | /* main loop */ |
215 | while (*str != '\0') { | |
216 | int found = 0; | |
217 | element_t *new = NULL; | |
04d68907 | 218 | VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str)); |
bc97a989 | 219 | |
2d0cd54c LM |
220 | /* end without printing */ |
221 | ||
222 | if (*str == ';') { | |
223 | if (root) { | |
224 | root->hidden = 1; | |
225 | } | |
226 | break; | |
227 | } | |
228 | ||
bc97a989 LM |
229 | /* skip spaces and tabs */ |
230 | ||
231 | if ((*str == ' ') || (*str == '\t')) { | |
232 | str++; | |
233 | continue; | |
234 | } | |
235 | ||
124da7fd LM |
236 | /* check for open brace */ |
237 | ||
238 | if (*str == '{') { | |
239 | VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n")); | |
62d56da6 | 240 | if (root != NULL) { |
124da7fd LM |
241 | delelement (root); |
242 | return ERROR_OP; | |
243 | } | |
62d56da6 | 244 | element_t **prog = NULL; |
05aabb97 | 245 | new = newelement (Code, 0, 5); |
62d56da6 LM |
246 | root = new; |
247 | prog = &root; | |
124da7fd LM |
248 | |
249 | do { | |
124da7fd LM |
250 | new = parser (str + 1, &str, 0); |
251 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { | |
252 | delelement (new); | |
253 | new = ERROR_OP; | |
254 | } | |
7929d368 | 255 | if (new == ERROR_OP) { |
124da7fd | 256 | delelement (root); |
62d56da6 | 257 | return ERROR_OP; |
124da7fd | 258 | } |
05aabb97 | 259 | element_t *newprog = newelement (Code, (*prog)->nbops + 1, 5); |
62d56da6 LM |
260 | for (i = 0; i < (*prog)->nbops; i++) { |
261 | newprog->ops[i] = (*prog)->ops[i]; | |
262 | (*prog)->ops[i] = NULL; | |
124da7fd | 263 | } |
62d56da6 LM |
264 | newprog->ops[(*prog)->nbops] = new; |
265 | delelement (*prog); | |
266 | (*prog) = newprog; | |
124da7fd LM |
267 | } while (*str == ','); |
268 | ||
269 | if (*str != '}') { | |
270 | delelement (root); | |
271 | return ERROR_OP; | |
272 | } | |
273 | str++; | |
274 | VERBOSE (DEBUG, fprintf (stdout, "stop processing brace\n")); | |
275 | continue; | |
276 | } | |
277 | ||
85b4a72c | 278 | /* check for open bracket */ |
0b489a77 | 279 | |
0b489a77 | 280 | if (*str == '(') { |
04d68907 | 281 | VERBOSE (DEBUG, fprintf (stdout, "start processing bracket\n")); |
0b489a77 | 282 | if (root) { |
85b4a72c LM |
283 | do { |
284 | found = 0; | |
ef37d966 | 285 | new = parser (str + 1, &str, 0); |
686c4bc2 | 286 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { |
67b13e3d LM |
287 | delelement (new); |
288 | new = ERROR_OP; | |
289 | } | |
686c4bc2 | 290 | if ((new == NULL) || (new == ERROR_OP)) { |
031d7bba | 291 | delelement (root); |
85b4a72c LM |
292 | return ERROR_OP; |
293 | } | |
294 | for (i = 0; i < root->nbops; i++) { | |
295 | if (root->ops[i] == NULL) { | |
0b489a77 LM |
296 | root->ops[i] = new; |
297 | found = 1; | |
298 | break; | |
299 | } | |
300 | } | |
85b4a72c | 301 | if (!found) { |
031d7bba LM |
302 | delelement (new); |
303 | delelement (root); | |
85b4a72c LM |
304 | return ERROR_OP; |
305 | } | |
306 | } while (*str == ','); | |
307 | } else { | |
3b4b0bbe | 308 | root = newelement (Val, 1, 5); |
ef37d966 | 309 | new = parser (str + 1, &str, 0); |
686c4bc2 | 310 | if ((new == NULL) || ((new != ERROR_OP) && (new->prio == 9))) { |
67b13e3d LM |
311 | delelement (new); |
312 | new = ERROR_OP; | |
313 | } | |
686c4bc2 | 314 | if ((new == NULL) || (new == ERROR_OP) || (*str == ',')) { |
031d7bba LM |
315 | delelement (new); |
316 | delelement (root); | |
efdfb543 LM |
317 | return ERROR_OP; |
318 | } | |
85b4a72c | 319 | root->ops[0] = new; |
0b489a77 | 320 | } |
3c0db5bc LM |
321 | if (*str != ')') { |
322 | delelement (root); | |
323 | return ERROR_OP; | |
324 | } | |
85b4a72c | 325 | str++; |
04d68907 | 326 | VERBOSE (DEBUG, fprintf (stdout, "stop processing bracket\n")); |
efdfb543 | 327 | continue; |
49223129 | 328 | } |
85b4a72c | 329 | |
124da7fd | 330 | /* check for closing bracket, closing brace or koma */ |
85b4a72c | 331 | |
124da7fd | 332 | if ((*str == ')') || (*str == '}') || (*str == ',')) { |
45a631a8 LM |
333 | if (prio == -9) { |
334 | delelement (root); | |
335 | return ERROR_OP; | |
336 | } | |
49223129 | 337 | if (next != NULL) { |
85b4a72c | 338 | *next = str; |
49223129 LM |
339 | } |
340 | return root; | |
0b489a77 LM |
341 | } |
342 | ||
bc97a989 LM |
343 | /* look for operators */ |
344 | ||
345 | for (i = 0; i < NB_OPERATORS; i++) { | |
346 | keyword_t *operator = operators + i; | |
347 | if (codecmp (operator->keyword, str) == 0) { | |
04d68907 | 348 | VERBOSE (DEBUG, fprintf (stdout, "start processing operator\n")); |
11cda8d7 | 349 | if (root) { |
ef37d966 | 350 | if ((prio) && (prio > operator->prio)) { |
04d68907 | 351 | VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); |
ef37d966 LM |
352 | *next = str; |
353 | return root; | |
354 | } | |
355 | str += operator->offset; | |
04d68907 | 356 | VERBOSE (INFO, fprintf (stdout, "Oper: %d\n", operator->func)); |
d2ff8478 | 357 | if (subparser (&root, &str, operator->func, operator->nbops, operator->prio) == ERROR_OP) { |
031d7bba | 358 | delelement (root); |
ef37d966 | 359 | return ERROR_OP; |
11cda8d7 | 360 | } |
3b4b0bbe | 361 | } else if (*str == '-') { |
d32ea0b0 | 362 | root = newelement (Sig, 1, 9); |
49223129 | 363 | } else { |
0b489a77 | 364 | return ERROR_OP; |
bc97a989 | 365 | } |
bc97a989 | 366 | found = 1; |
04d68907 | 367 | VERBOSE (DEBUG, fprintf (stdout, "stop processing operator\n")); |
bc97a989 LM |
368 | break; |
369 | } | |
370 | } | |
371 | if (found) { | |
bc97a989 LM |
372 | continue; |
373 | } | |
49223129 | 374 | |
bc97a989 LM |
375 | /* look for functions */ |
376 | ||
377 | for (i = 0; i < NB_FUNCTIONS; i++) { | |
378 | keyword_t *function = functions + i; | |
379 | if (codecmp (function->keyword, str) == 0) { | |
04d68907 | 380 | VERBOSE (DEBUG, fprintf (stdout, "start processing function\n")); |
bc97a989 | 381 | if (root == NULL) { |
04d68907 | 382 | VERBOSE (INFO, fprintf (stdout, "Func: %d\n", function->func)); |
d32ea0b0 | 383 | root = newelement (function->func, function->nbops, function->prio); |
031d7bba LM |
384 | } else { |
385 | delelement (root); | |
0b489a77 | 386 | return ERROR_OP; |
bc97a989 LM |
387 | } |
388 | str += function->offset; | |
389 | found = 1; | |
04d68907 | 390 | VERBOSE (DEBUG, fprintf (stdout, "stop processing function\n")); |
bc97a989 LM |
391 | break; |
392 | } | |
393 | } | |
394 | if (found) { | |
bc97a989 LM |
395 | continue; |
396 | } | |
397 | ||
471da7c9 LM |
398 | /* look for constant */ |
399 | ||
400 | for (i = 0; i < NB_CONSTANTS; i++) { | |
401 | keyword_t *constant = constants + i; | |
402 | if (codecmp (constant->keyword, str) == 0) { | |
403 | VERBOSE (DEBUG, fprintf (stdout, "start processing constant\n")); | |
404 | if (root == NULL) { | |
5075f6ea | 405 | VERBOSE (INFO, fprintf (stdout, "Const: %d\n", constant->func)); |
d32ea0b0 | 406 | root = newelement (constant->func, constant->nbops, constant->prio); |
471da7c9 LM |
407 | } else { |
408 | delelement (root); | |
409 | return ERROR_OP; | |
410 | } | |
411 | str += constant->offset; | |
412 | found = 1; | |
413 | VERBOSE (DEBUG, fprintf (stdout, "stop processing constant\n")); | |
414 | break; | |
415 | } | |
416 | } | |
417 | if (found) { | |
418 | continue; | |
419 | } | |
420 | ||
bc97a989 LM |
421 | /* look for number */ |
422 | ||
0b9cc9b0 LM |
423 | if (((*str >= '0') && (*str <= '9')) || |
424 | (*str == '.') || (*str == '+') || (*str == '-')) { | |
04d68907 | 425 | VERBOSE (DEBUG, fprintf (stdout, "start processing value\n")); |
bc97a989 | 426 | char *pt; |
fd88e359 | 427 | double value = strtod (str, &pt); |
04d68907 | 428 | VERBOSE (INFO, fprintf (stdout, "Value: %f\n", value)); |
bc97a989 | 429 | if (str != pt) { |
ce6627f2 | 430 | if ((root == NULL) || (root->prio == 6)) { |
3b4b0bbe | 431 | new = newelement (Val, 1, 5); |
c47a9298 | 432 | new->value = value; |
ce6627f2 LM |
433 | if (root == NULL) { |
434 | root = new; | |
435 | } else { | |
436 | for (i = 0; i < root->nbops; i++) { | |
437 | if (root->ops[i] == NULL) { | |
438 | root->ops[i] = new; | |
439 | found = 1; | |
440 | break; | |
441 | } | |
442 | } | |
443 | if (!found) { | |
444 | delelement (new); | |
445 | delelement (root); | |
446 | return ERROR_OP; | |
447 | } | |
448 | } | |
c47a9298 | 449 | str = pt; |
32741902 LM |
450 | } else if ((*str == '+') || (*str == '-')) { |
451 | if ((prio) && (prio > 1)) { | |
452 | VERBOSE (DEBUG, fprintf (stdout, "stop because operator priority\n")); | |
453 | *next = str; | |
454 | return root; | |
455 | } | |
456 | if (subparser (&root, &str, Add, 2, 1) == ERROR_OP) { | |
031d7bba | 457 | delelement (root); |
0b489a77 | 458 | return ERROR_OP; |
bc97a989 | 459 | } |
0b9cc9b0 | 460 | } else { |
031d7bba | 461 | delelement (root); |
0b9cc9b0 | 462 | return ERROR_OP; |
bc97a989 | 463 | } |
bc97a989 LM |
464 | found = 1; |
465 | } | |
04d68907 | 466 | VERBOSE (DEBUG, fprintf (stdout, "stop processing value\n")); |
bc97a989 LM |
467 | } |
468 | ||
469 | /* error */ | |
470 | ||
471 | if (!found) { | |
031d7bba | 472 | delelement (root); |
0b489a77 | 473 | return ERROR_OP; |
bc97a989 LM |
474 | } |
475 | ||
476 | } | |
477 | ||
49223129 LM |
478 | if (next != NULL) { |
479 | *next = str; | |
480 | } | |
031d7bba | 481 | |
779282bb | 482 | /* save string */ |
0a8a1de3 ML |
483 | if (root != NULL) { |
484 | root->string = string; | |
485 | } | |
779282bb | 486 | |
bc97a989 LM |
487 | return root; |
488 | } | |
489 | ||
490 | /* print element tree */ | |
491 | ||
492 | void print_element (element_t *root, int level) | |
493 | { | |
494 | char *func = NULL; | |
495 | int i; | |
496 | ||
49223129 | 497 | if ((root == NULL) || (root == ERROR_OP)) { |
bc97a989 | 498 | return; |
49223129 LM |
499 | } |
500 | ||
bc97a989 | 501 | for (i = 0; i < level; i++) { |
04d68907 | 502 | fprintf (stdout, " "); |
bc97a989 LM |
503 | } |
504 | ||
505 | switch (root->func) { | |
506 | case Val: func = "Value"; break; | |
89cf0955 | 507 | case Sig: func = "Sign"; break; |
bc97a989 LM |
508 | case Add: func = "Addition"; break; |
509 | case Sub: func = "Subtraction"; break; | |
510 | case Mul: func = "Multiplication"; break; | |
511 | case Div: func = "Division"; break; | |
c47a9298 | 512 | case Mod: func = "Modulo"; break; |
bc97a989 LM |
513 | case Pow: func = "Power"; break; |
514 | case Sqr: func = "Square Root"; break; | |
515 | case Cos: func = "Cosine"; break; | |
516 | case Sin: func = "Sine"; break; | |
9e52bbc5 LM |
517 | case Tan: func = "Tangent"; break; |
518 | case Acos: func = "Arc Cosine"; break; | |
519 | case Asin: func = "Arc Sine"; break; | |
471da7c9 | 520 | case Atan: func = "Arc Tangent"; break; |
bc97a989 LM |
521 | case Log: func = "Logarithm"; break; |
522 | case Exp: func = "Exponantial"; break; | |
9e52bbc5 LM |
523 | case Abs: func = "Absolute value"; break; |
524 | case Ceil: func = "Ceil value"; break; | |
525 | case Floor: func = "Floor value"; break; | |
6ba1dd0f LM |
526 | case Store: func = "Store"; break; |
527 | case Recall: func = "Recall"; break; | |
a8cf32ba LM |
528 | case Inc: func = "Increase"; break; |
529 | case Dec: func = "Decrease"; break; | |
6ba1dd0f | 530 | case Disp: func = "Display"; break; |
f438579a | 531 | case Mem: func = "Memory"; break; |
143f91ae | 532 | case Clear: func = "Clear"; break; |
471da7c9 LM |
533 | case Quit: func = "Quit"; break; |
534 | case Help: func = "Help"; break; | |
5075f6ea | 535 | case Ans: func = "Ans"; break; |
471da7c9 LM |
536 | case Pi: func = "Pi"; break; |
537 | case E: func = "E"; break; | |
7fe742c9 LM |
538 | case Equal: func = "Equal"; break; |
539 | case Diff: func = "Different"; break; | |
540 | case Ge: func = "Greater or equal"; break; | |
541 | case Le: func = "Lesser or equal"; break; | |
542 | case Gt: func = "Greater"; break; | |
543 | case Lt: func = "Lesser"; break; | |
ca3e2a2f LM |
544 | case And: func = "And"; break; |
545 | case Or: func = "Or"; break; | |
546 | case Not: func = "Not"; break; | |
94b4e517 | 547 | case Cond: func = "Condition"; break; |
2a688642 | 548 | case While: func = "While"; break; |
05aabb97 | 549 | case Code: func = "Code"; break; |
715580ff | 550 | case Print: func = "Print"; break; |
c7cbb833 LM |
551 | case Prog: func = "Program"; break; |
552 | case Call: func = "Call"; break; | |
553 | case List: func = "List"; break; | |
554 | case Edit: func = "Edit"; break; | |
555 | case Del: func = "Del"; break; | |
bc97a989 LM |
556 | } |
557 | ||
04d68907 | 558 | fprintf (stdout, "Function: %s\n", func); |
bc97a989 | 559 | |
85b4a72c | 560 | if ((root->func == Val) && (root->ops[0] == NULL)) { |
bc97a989 | 561 | for (i = 0; i < level; i++) { |
04d68907 | 562 | fprintf (stdout, " "); |
bc97a989 | 563 | } |
04d68907 | 564 | fprintf (stdout, "value: %f\n", root->value); |
bc97a989 LM |
565 | } else { |
566 | for (i = 0; i < root->nbops; i++) { | |
567 | print_element (root->ops[i], level + 1); | |
568 | } | |
569 | } | |
570 | } | |
571 | ||
6ba1dd0f LM |
572 | /* storage functions */ |
573 | ||
f438579a LM |
574 | void memory (int nb) |
575 | { | |
576 | int i, l; | |
577 | double *tmp = NULL; | |
578 | if (nb != storage_size) { | |
579 | l = (nb < storage_size) ? nb : storage_size; | |
6f14d1cc | 580 | tmp = (double *) callocordie (nb, sizeof (double)); |
f438579a LM |
581 | for (i = 0; i < l; i++) { |
582 | tmp[i] = storage[i]; | |
583 | } | |
584 | if (storage != NULL) { | |
585 | free (storage); | |
586 | } | |
587 | storage = tmp; | |
588 | storage_size = nb; | |
589 | } | |
590 | } | |
591 | ||
3639df66 | 592 | double store (int index, double value) |
6ba1dd0f | 593 | { |
f438579a LM |
594 | if (storage_size == -1) { |
595 | memory (DEFAULT_STORAGE_SIZE); | |
596 | } | |
597 | if ((index > 0) && (index <= storage_size)) { | |
3639df66 | 598 | storage[index - 1] = value; |
6ba1dd0f | 599 | } else { |
9b759869 | 600 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
6ba1dd0f | 601 | } |
3639df66 | 602 | return value; |
6ba1dd0f LM |
603 | } |
604 | ||
605 | double recall (int index) | |
606 | { | |
f438579a LM |
607 | if (storage_size == -1) { |
608 | memory (DEFAULT_STORAGE_SIZE); | |
609 | } | |
610 | if ((index > 0) && (index <= storage_size)) { | |
6ba1dd0f LM |
611 | return storage[index - 1]; |
612 | } else { | |
9b759869 | 613 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
6ba1dd0f LM |
614 | } |
615 | return 0; | |
616 | } | |
617 | ||
a8cf32ba LM |
618 | double increase (int index) |
619 | { | |
f438579a LM |
620 | if (storage_size == -1) { |
621 | memory (DEFAULT_STORAGE_SIZE); | |
622 | } | |
623 | if ((index > 0) && (index <= storage_size)) { | |
a8cf32ba LM |
624 | return storage[index - 1]++; |
625 | } else { | |
9b759869 | 626 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
a8cf32ba LM |
627 | } |
628 | return 0; | |
629 | } | |
630 | ||
631 | double decrease (int index) | |
632 | { | |
f438579a LM |
633 | if (storage_size == -1) { |
634 | memory (DEFAULT_STORAGE_SIZE); | |
635 | } | |
636 | if ((index > 0) && (index <= storage_size)) { | |
a8cf32ba LM |
637 | return storage[index - 1]--; |
638 | } else { | |
9b759869 | 639 | VERBOSE (WARNING, fprintf (stdout, "invalid index (%d) [%d, %d]\n", index, (storage_size) ? 1 : 0, storage_size)); |
a8cf32ba LM |
640 | } |
641 | return 0; | |
642 | } | |
643 | ||
6ba1dd0f LM |
644 | void display (void) |
645 | { | |
646 | int i; | |
f438579a LM |
647 | if (storage_size == -1) { |
648 | memory (DEFAULT_STORAGE_SIZE); | |
649 | } | |
6ba1dd0f | 650 | fprintf (stdout, "storage:"); |
f438579a | 651 | for (i = 0; i < storage_size; i++) { |
9b759869 LM |
652 | fprintf (stdout, " "); |
653 | fprintf (stdout, minform, storage[i]); | |
6ba1dd0f LM |
654 | } |
655 | fprintf (stdout, "\n"); | |
656 | } | |
657 | ||
143f91ae LM |
658 | void clear () |
659 | { | |
660 | int i; | |
661 | for (i = 0; i < storage_size; i++) { | |
662 | storage[i] = 0; | |
663 | } | |
664 | } | |
665 | ||
2a688642 LM |
666 | /* While do function */ |
667 | ||
668 | double while_do (element_t *cond, element_t *action) | |
669 | { | |
670 | double ret = 0; | |
671 | element_t *temp = NULL; | |
672 | ||
673 | VERBOSE (DEBUG, fprintf (stdout, "starting while loop\n")); | |
2a688642 LM |
674 | while (1) { |
675 | VERBOSE (DEBUG, fprintf (stdout, "loop...\n")); | |
676 | ||
677 | temp = dupelement (cond); | |
523841a1 ML |
678 | double test = evaluate_element (temp, 0); |
679 | delelement (temp); | |
680 | if (!test) { | |
2a688642 LM |
681 | break; |
682 | } | |
683 | if (action) { | |
684 | temp = dupelement (action); | |
685 | ret = evaluate_element (temp, 0); | |
523841a1 | 686 | delelement (temp); |
2a688642 LM |
687 | } |
688 | } | |
689 | ||
690 | VERBOSE (DEBUG, fprintf (stdout, "ending while loop\n")); | |
691 | ||
692 | return ret; | |
693 | } | |
694 | ||
124da7fd LM |
695 | /* program function */ |
696 | ||
05aabb97 | 697 | double execute_code (element_t **prog, int nbcalls) |
124da7fd LM |
698 | { |
699 | double ret = 0; | |
700 | int i; | |
701 | for (i = 0; i < nbcalls; i++) { | |
702 | ret = evaluate_element (prog[i], 0); | |
703 | prog[i] = NULL; | |
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); | |
835 | storage = tmp; | |
836 | 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"); |
94b4e517 LM |
964 | fprintf (stdout, "supported operators:"); |
965 | fprintf (stdout, " + - * / %% ^\n"); | |
966 | fprintf (stdout, "camparison operators:"); | |
967 | fprintf (stdout, " == != >= <= > <\n"); | |
968 | fprintf (stdout, "logical operators:"); | |
969 | fprintf (stdout, " & | !\n"); | |
9e52bbc5 | 970 | fprintf (stdout, "mathematic functions:"); |
b9c1c40d | 971 | fprintf (stdout, " pow sqrt log exp\n"); |
9049369f | 972 | fprintf (stdout, "trig. func.:"); |
b9c1c40d | 973 | fprintf (stdout, " cos sin tan acos asin atan\n"); |
94b4e517 | 974 | fprintf (stdout, "supported functions:"); |
9e52bbc5 | 975 | fprintf (stdout, " abs ceil floor\n"); |
94b4e517 | 976 | fprintf (stdout, "storage functions:"); |
f438579a | 977 | fprintf (stdout, " mem sto rcl inc dec disp\n"); |
9049369f | 978 | fprintf (stdout, "prog. functions:"); |
2d0cd54c | 979 | fprintf (stdout, " cond while print {} ;\n"); |
9049369f | 980 | fprintf (stdout, "misc. functions:"); |
94b4e517 LM |
981 | fprintf (stdout, " quit help\n"); |
982 | fprintf (stdout, "supported constants:"); | |
471da7c9 | 983 | fprintf (stdout, " e pi\n"); |
89cf0955 | 984 | } |
3b4b0bbe | 985 | |
f2927108 LM |
986 | /* evaluate element tree */ |
987 | ||
89cf0955 LM |
988 | #define MASK_SUB 0x1 |
989 | #define MASK_DIV 0x2 | |
990 | ||
3b4b0bbe | 991 | double evaluate_element (element_t *root, char mask) |
f2927108 LM |
992 | { |
993 | double op0 = 0, op1 = 0; | |
3b4b0bbe | 994 | char nextmask = mask; |
e7d5c144 | 995 | int i, nb; |
f2927108 LM |
996 | |
997 | if ((root == NULL) || (root == ERROR_OP)) { | |
04d68907 | 998 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n")); |
f2927108 LM |
999 | return 0; |
1000 | } | |
1001 | ||
3b4b0bbe LM |
1002 | /* mask to manage sub operator sub and div */ |
1003 | switch (root->func) { | |
1004 | case Add: | |
1005 | nextmask &= ~MASK_SUB; | |
1006 | nextmask &= ~MASK_DIV; | |
1007 | break; | |
1008 | case Sub: | |
1009 | nextmask |= MASK_SUB; | |
1010 | nextmask &= ~MASK_DIV; | |
1011 | break; | |
1012 | case Mul: | |
1013 | nextmask &= ~MASK_DIV; | |
1014 | break; | |
1015 | case Div: | |
1016 | nextmask |= MASK_DIV; | |
1017 | break; | |
1018 | default: | |
1019 | nextmask = mask; | |
1020 | } | |
1021 | ||
f2927108 LM |
1022 | switch (root->func) { |
1023 | case Val: | |
3b4b0bbe LM |
1024 | case Sig: |
1025 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value; | |
f2927108 LM |
1026 | break; |
1027 | case Add: | |
1028 | case Sub: | |
1029 | case Mul: | |
1030 | case Div: | |
c47a9298 | 1031 | case Mod: |
f2927108 | 1032 | case Pow: |
3639df66 | 1033 | case Store: |
7fe742c9 LM |
1034 | case Equal: |
1035 | case Diff: | |
1036 | case Ge: | |
1037 | case Le: | |
1038 | case Gt: | |
1039 | case Lt: | |
ca3e2a2f LM |
1040 | case And: |
1041 | case Or: | |
c7cbb833 | 1042 | case Prog: |
f2927108 | 1043 | if (root->ops[1]) { |
3b4b0bbe | 1044 | op1 = evaluate_element (root->ops[1], nextmask); |
3639df66 | 1045 | } else if (root->func != Store) { |
04d68907 | 1046 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n")); |
f2927108 LM |
1047 | return 0; |
1048 | } | |
1049 | /* fallthrough */ | |
1050 | case Sqr: | |
1051 | case Cos: | |
1052 | case Sin: | |
9e52bbc5 LM |
1053 | case Tan: |
1054 | case Acos: | |
1055 | case Asin: | |
471da7c9 | 1056 | case Atan: |
f2927108 LM |
1057 | case Log: |
1058 | case Exp: | |
9e52bbc5 LM |
1059 | case Abs: |
1060 | case Ceil: | |
1061 | case Floor: | |
6ba1dd0f | 1062 | case Recall: |
a8cf32ba LM |
1063 | case Inc: |
1064 | case Dec: | |
ca3e2a2f | 1065 | case Not: |
f438579a | 1066 | case Mem: |
94b4e517 | 1067 | case Cond: |
c7cbb833 | 1068 | case Call: |
c7cbb833 LM |
1069 | case Edit: |
1070 | case Del: | |
f2927108 | 1071 | if (root->ops[0]) { |
3b4b0bbe | 1072 | op0 = evaluate_element (root->ops[0], 0); |
f2927108 | 1073 | } else { |
04d68907 | 1074 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); |
f2927108 LM |
1075 | return 0; |
1076 | } | |
89cf0955 | 1077 | break; |
6ba1dd0f | 1078 | case Disp: |
143f91ae | 1079 | case Clear: |
471da7c9 LM |
1080 | case Quit: |
1081 | case Help: | |
5075f6ea | 1082 | case Ans: |
471da7c9 LM |
1083 | case Pi: |
1084 | case E: | |
05aabb97 | 1085 | case Code: |
e7d5c144 | 1086 | case List: |
09d87cae | 1087 | break; |
2a688642 | 1088 | case While: |
09d87cae LM |
1089 | if (root->ops[0] == NULL) { |
1090 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); | |
1091 | return 0; | |
1092 | } | |
89cf0955 | 1093 | break; |
715580ff LM |
1094 | case Print: |
1095 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer; | |
1096 | break; | |
f2927108 LM |
1097 | } |
1098 | ||
1099 | switch (root->func) { | |
3b4b0bbe LM |
1100 | case Val: return op0; |
1101 | case Sig: return -op0; | |
1102 | case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1; | |
1103 | case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1; | |
1104 | case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1; | |
1105 | case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1; | |
c47a9298 | 1106 | case Mod: return fmod (op0, op1); |
f2927108 LM |
1107 | case Pow: return pow (op0, op1); |
1108 | case Sqr: return sqrt (op0); | |
1109 | case Cos: return cos (op0); | |
1110 | case Sin: return sin (op0); | |
9e52bbc5 LM |
1111 | case Tan: return tan (op0); |
1112 | case Acos: return acos (op0); | |
1113 | case Asin: return asin (op0); | |
471da7c9 | 1114 | case Atan: return atan (op0); |
f2927108 LM |
1115 | case Log: return log (op0); |
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: */ |