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