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 | { |
6f14d1cc | 53 | void *new = calloc (count, size); |
bc97a989 | 54 | if (new == NULL) { |
04d68907 | 55 | VERBOSE (ERROR, fprintf (stderr, "can't allocate memory\n")); |
d32ea0b0 | 56 | exit (1); |
bc97a989 | 57 | } |
6f14d1cc LM |
58 | return new; |
59 | } | |
60 | ||
61 | /* allocate new element */ | |
62 | ||
63 | element_t *newelement (func_t function, int nbops, int prio) | |
64 | { | |
65 | element_t *new = (element_t *) callocordie (1, sizeof (element_t)); | |
62d56da6 | 66 | if (nbops) { |
6f14d1cc | 67 | new->ops = (element_t **) callocordie (nbops, sizeof (element_t *)); |
0c95a3d3 | 68 | } |
bc97a989 LM |
69 | new->func = function; |
70 | new->nbops = nbops; | |
11cda8d7 | 71 | new->prio = prio; |
bc97a989 LM |
72 | |
73 | return new; | |
74 | } | |
75 | ||
031d7bba LM |
76 | /* desallocate element */ |
77 | ||
78 | void delelement (element_t *root) | |
79 | { | |
031d7bba | 80 | if ((root != NULL) && (root != ERROR_OP)) { |
0c95a3d3 | 81 | int i; |
031d7bba LM |
82 | for (i = 0; i < root->nbops; i++) { |
83 | if ((root->ops[i] != NULL) && (root->ops[i] != ERROR_OP)) { | |
84 | delelement (root->ops[i]); | |
85 | } | |
86 | } | |
0c95a3d3 LM |
87 | if (root->nbops) { |
88 | free (root->ops); | |
89 | } | |
031d7bba LM |
90 | free (root); |
91 | } | |
92 | } | |
93 | ||
2a688642 LM |
94 | /* duplicate element */ |
95 | ||
96 | element_t *dupelement (element_t *root) | |
97 | { | |
98 | element_t *tmp = NULL; | |
99 | int i; | |
100 | ||
101 | if ((root == NULL) || (root == ERROR_OP)) { | |
102 | return root; | |
103 | } | |
104 | tmp = newelement (root->func, root->nbops, root->prio); | |
2a688642 LM |
105 | tmp->value = root->value; |
106 | for (i = 0; i < root->nbops; i++) { | |
107 | tmp->ops[i] = dupelement (root->ops[i]); | |
2a688642 LM |
108 | } |
109 | return tmp; | |
110 | } | |
111 | ||
bc97a989 LM |
112 | /* functions */ |
113 | ||
ca3e2a2f | 114 | #define NB_OPERATORS 14 |
bc97a989 | 115 | keyword_t operators[NB_OPERATORS] = { |
11cda8d7 LM |
116 | { "+\t", Add, 2, 1, 1}, |
117 | { "-\t", Sub, 2, 1, 1}, | |
118 | { "*", Mul, 2, 1, 2}, | |
119 | { "/", Div, 2, 1, 2}, | |
c47a9298 | 120 | { "%", Mod, 2, 1, 3}, |
7fe742c9 | 121 | { "^", Pow, 2, 1, 4}, |
ca3e2a2f LM |
122 | { "==", Equal, 2, 2, -1}, |
123 | { "!=", Diff, 2, 2, -1}, | |
124 | { ">=", Ge, 2, 2, -1}, | |
125 | { "<=", Le, 2, 2, -1}, | |
126 | { ">", Gt, 2, 1, -1}, | |
127 | { "<", Lt, 2, 1, -1}, | |
128 | { "&", And, 2, 1, -2}, | |
129 | { "|", Or, 2, 1, -2} | |
bc97a989 LM |
130 | }; |
131 | ||
c7cbb833 | 132 | #define NB_FUNCTIONS 31 |
bc97a989 | 133 | keyword_t functions[NB_FUNCTIONS] = { |
c47a9298 LM |
134 | { "sqrt", Sqr, 1, 4, 5}, |
135 | { "pow", Pow, 2, 3, 5}, | |
136 | { "cos", Cos, 1, 3, 5}, | |
137 | { "sin", Sin, 1, 3, 5}, | |
9e52bbc5 LM |
138 | { "tan", Tan, 1, 3, 5}, |
139 | { "acos", Acos, 1, 4, 5}, | |
140 | { "asin", Asin, 1, 4, 5}, | |
471da7c9 | 141 | { "atan", Atan, 1, 4, 5}, |
89cf0955 | 142 | { "log", Log, 1, 3, 5}, |
9e52bbc5 LM |
143 | { "exp", Exp, 1, 3, 5}, |
144 | { "abs", Abs, 1, 3, 5}, | |
145 | { "floor", Floor, 1, 5, 5}, | |
146 | { "ceil", Ceil, 1, 4, 5}, | |
2a688642 | 147 | { "sto", Store, 2, 3, 5}, |
6ba1dd0f | 148 | { "rcl", Recall, 1, 3, 5}, |
a8cf32ba LM |
149 | { "inc", Inc, 1, 3, 5}, |
150 | { "dec", Dec, 1, 3, 5}, | |
ca3e2a2f | 151 | { "disp", Disp, 0, 4, 9}, |
f438579a | 152 | { "mem", Mem, 1, 3, 9}, |
143f91ae | 153 | { "clr", Clear, 0, 3, 9}, |
ca3e2a2f LM |
154 | { "quit", Quit, 0, 4, 9}, |
155 | { "help", Help, 0, 4, 9}, | |
94b4e517 | 156 | { "!", Not, 1, 1, 6}, |
2a688642 | 157 | { "cond", Cond, 3, 4, 5}, |
715580ff | 158 | { "while", While, 2, 5, 5}, |
c7cbb833 LM |
159 | { "print", Print, 1, 5, 5}, |
160 | { "prog", Prog, 3, 4, 9}, | |
161 | { "call", Call, 10, 4, 5}, | |
162 | { "ls", List, 0, 2, 9}, | |
163 | { "edit", Edit, 1, 4, 9}, | |
164 | { "del", Del, 1, 3, 9} | |
471da7c9 LM |
165 | }; |
166 | ||
5075f6ea | 167 | #define NB_CONSTANTS 3 |
471da7c9 | 168 | keyword_t constants[NB_CONSTANTS] = { |
5075f6ea LM |
169 | { "ans", Ans, 0, 3, 5}, |
170 | { "e", E, 0, 1, 5}, | |
171 | { "pi", Pi, 0, 2, 5} | |
bc97a989 LM |
172 | }; |
173 | ||
db660e60 LM |
174 | #define NB_SYMBOLS 4 |
175 | char *symbols[NB_SYMBOLS] = { | |
176 | "(", ")", "{", "}" | |
177 | }; | |
178 | ||
d2ff8478 LM |
179 | /* subparser function */ |
180 | ||
181 | element_t *subparser (element_t **proot, char **pstr, func_t func, int nbops, int prio) | |
182 | { | |
183 | element_t *new = newelement (func, nbops, prio); | |
d2ff8478 LM |
184 | new->ops[0] = *proot; |
185 | new->ops[1] = parser (*pstr, pstr, new->prio); | |
686c4bc2 | 186 | if ((new->ops[1] == NULL) || ((new->ops[1] != ERROR_OP) && (new->ops[1]->prio == 9))) { |
67b13e3d LM |
187 | delelement (new->ops[1]); |
188 | new->ops[1] = ERROR_OP; | |
189 | } | |
d2ff8478 | 190 | if (new->ops[1] == ERROR_OP) { |
031d7bba LM |
191 | delelement (new); |
192 | *proot = NULL; | |
d2ff8478 LM |
193 | return ERROR_OP; |
194 | } | |
3b4b0bbe | 195 | *proot = newelement (Val, 1, 5); |
d2ff8478 LM |
196 | (*proot)->ops[0] = new; |
197 | ||
198 | return *proot; | |
199 | } | |
200 | ||
bc97a989 LM |
201 | /* parser function */ |
202 | ||
ef37d966 | 203 | element_t *parser (char *str, char **next, int prio) |
0b489a77 | 204 | { |
bc97a989 | 205 | element_t *root = NULL; |
85b4a72c | 206 | int i; |
bc97a989 | 207 | |
04d68907 | 208 | VERBOSE (DEBUG, fprintf (stdout, "Starting parsing\n")); |
49223129 | 209 | |
bc97a989 LM |
210 | /* main loop */ |
211 | while (*str != '\0') { | |
212 | int found = 0; | |
213 | element_t *new = NULL; | |
04d68907 | 214 | VERBOSE (INFO, fprintf (stdout, "Processing: %s\n", str)); |
bc97a989 | 215 | |
2d0cd54c LM |
216 | /* end without printing */ |
217 | ||
218 | if (*str == ';') { | |
219 | if (root) { | |
220 | root->hidden = 1; | |
221 | } | |
222 | break; | |
223 | } | |
224 | ||
bc97a989 LM |
225 | /* skip spaces and tabs */ |
226 | ||
227 | if ((*str == ' ') || (*str == '\t')) { | |
228 | str++; | |
229 | continue; | |
230 | } | |
231 | ||
124da7fd LM |
232 | /* check for open brace */ |
233 | ||
234 | if (*str == '{') { | |
235 | VERBOSE (DEBUG, fprintf (stdout, "start processing brace\n")); | |
62d56da6 | 236 | if (root != NULL) { |
124da7fd LM |
237 | delelement (root); |
238 | return ERROR_OP; | |
239 | } | |
62d56da6 | 240 | element_t **prog = NULL; |
05aabb97 | 241 | new = newelement (Code, 0, 5); |
62d56da6 LM |
242 | root = new; |
243 | prog = &root; | |
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 | } |
05aabb97 | 255 | element_t *newprog = newelement (Code, (*prog)->nbops + 1, 5); |
62d56da6 LM |
256 | for (i = 0; i < (*prog)->nbops; i++) { |
257 | newprog->ops[i] = (*prog)->ops[i]; | |
258 | (*prog)->ops[i] = NULL; | |
124da7fd | 259 | } |
62d56da6 LM |
260 | newprog->ops[(*prog)->nbops] = new; |
261 | delelement (*prog); | |
262 | (*prog) = 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 | |
bc97a989 LM |
478 | return root; |
479 | } | |
480 | ||
481 | /* print element tree */ | |
482 | ||
483 | void print_element (element_t *root, int level) | |
484 | { | |
485 | char *func = NULL; | |
486 | int i; | |
487 | ||
49223129 | 488 | if ((root == NULL) || (root == ERROR_OP)) { |
bc97a989 | 489 | return; |
49223129 LM |
490 | } |
491 | ||
bc97a989 | 492 | for (i = 0; i < level; i++) { |
04d68907 | 493 | fprintf (stdout, " "); |
bc97a989 LM |
494 | } |
495 | ||
496 | switch (root->func) { | |
497 | case Val: func = "Value"; break; | |
89cf0955 | 498 | case Sig: func = "Sign"; break; |
bc97a989 LM |
499 | case Add: func = "Addition"; break; |
500 | case Sub: func = "Subtraction"; break; | |
501 | case Mul: func = "Multiplication"; break; | |
502 | case Div: func = "Division"; break; | |
c47a9298 | 503 | case Mod: func = "Modulo"; break; |
bc97a989 LM |
504 | case Pow: func = "Power"; break; |
505 | case Sqr: func = "Square Root"; break; | |
506 | case Cos: func = "Cosine"; break; | |
507 | case Sin: func = "Sine"; break; | |
9e52bbc5 LM |
508 | case Tan: func = "Tangent"; break; |
509 | case Acos: func = "Arc Cosine"; break; | |
510 | case Asin: func = "Arc Sine"; break; | |
471da7c9 | 511 | case Atan: func = "Arc Tangent"; break; |
bc97a989 LM |
512 | case Log: func = "Logarithm"; break; |
513 | case Exp: func = "Exponantial"; break; | |
9e52bbc5 LM |
514 | case Abs: func = "Absolute value"; break; |
515 | case Ceil: func = "Ceil value"; break; | |
516 | case Floor: func = "Floor value"; break; | |
6ba1dd0f LM |
517 | case Store: func = "Store"; break; |
518 | case Recall: func = "Recall"; break; | |
a8cf32ba LM |
519 | case Inc: func = "Increase"; break; |
520 | case Dec: func = "Decrease"; break; | |
6ba1dd0f | 521 | case Disp: func = "Display"; break; |
f438579a | 522 | case Mem: func = "Memory"; break; |
143f91ae | 523 | case Clear: func = "Clear"; break; |
471da7c9 LM |
524 | case Quit: func = "Quit"; break; |
525 | case Help: func = "Help"; break; | |
5075f6ea | 526 | case Ans: func = "Ans"; break; |
471da7c9 LM |
527 | case Pi: func = "Pi"; break; |
528 | case E: func = "E"; break; | |
7fe742c9 LM |
529 | case Equal: func = "Equal"; break; |
530 | case Diff: func = "Different"; break; | |
531 | case Ge: func = "Greater or equal"; break; | |
532 | case Le: func = "Lesser or equal"; break; | |
533 | case Gt: func = "Greater"; break; | |
534 | case Lt: func = "Lesser"; break; | |
ca3e2a2f LM |
535 | case And: func = "And"; break; |
536 | case Or: func = "Or"; break; | |
537 | case Not: func = "Not"; break; | |
94b4e517 | 538 | case Cond: func = "Condition"; break; |
2a688642 | 539 | case While: func = "While"; break; |
05aabb97 | 540 | case Code: func = "Code"; break; |
715580ff | 541 | case Print: func = "Print"; break; |
c7cbb833 LM |
542 | case Prog: func = "Program"; break; |
543 | case Call: func = "Call"; break; | |
544 | case List: func = "List"; break; | |
545 | case Edit: func = "Edit"; break; | |
546 | case Del: func = "Del"; break; | |
bc97a989 LM |
547 | } |
548 | ||
04d68907 | 549 | fprintf (stdout, "Function: %s\n", func); |
bc97a989 | 550 | |
85b4a72c | 551 | if ((root->func == Val) && (root->ops[0] == NULL)) { |
bc97a989 | 552 | for (i = 0; i < level; i++) { |
04d68907 | 553 | fprintf (stdout, " "); |
bc97a989 | 554 | } |
04d68907 | 555 | fprintf (stdout, "value: %f\n", root->value); |
bc97a989 LM |
556 | } else { |
557 | for (i = 0; i < root->nbops; i++) { | |
558 | print_element (root->ops[i], level + 1); | |
559 | } | |
560 | } | |
561 | } | |
562 | ||
6ba1dd0f LM |
563 | /* storage functions */ |
564 | ||
f438579a LM |
565 | void memory (int nb) |
566 | { | |
567 | int i, l; | |
568 | double *tmp = NULL; | |
569 | if (nb != storage_size) { | |
570 | l = (nb < storage_size) ? nb : storage_size; | |
6f14d1cc | 571 | tmp = (double *) callocordie (nb, sizeof (double)); |
f438579a LM |
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 */ | |
6f14d1cc | 744 | programs = (workspace_t *) callocordie (1, sizeof (workspace_t)); |
05aabb97 LM |
745 | nb_programs = 1; |
746 | n = 0; | |
747 | ||
748 | } else { | |
749 | ||
750 | /* look for existing program */ | |
751 | for (i = 0; i < nb_programs; i++) { | |
752 | if ((programs + i)->id == id) { | |
753 | n = i; | |
754 | break; | |
755 | } | |
756 | } | |
757 | if (n == -1) { | |
758 | ||
759 | /* new program */ | |
760 | n = nb_programs++; | |
6f14d1cc LM |
761 | workspace_t *tmp = (workspace_t *) callocordie (nb_programs, sizeof (workspace_t)); |
762 | memcpy (tmp, programs, (nb_programs - 1) * sizeof (workspace_t)); | |
763 | free (programs); | |
764 | programs = tmp; | |
05aabb97 LM |
765 | } else { |
766 | ||
767 | /* clean old program */ | |
768 | if ((programs + n)->storage) { | |
769 | free ((programs + n)->storage); | |
770 | } | |
771 | if ((programs + n)->root) { | |
772 | delelement ((programs + n)->root); | |
773 | } | |
774 | } | |
775 | } | |
776 | ||
777 | /* set program */ | |
778 | (programs + n)->id = id; | |
779 | (programs + n)->answer = 0; | |
6f14d1cc | 780 | (programs + n)->storage = (double *) callocordie (nbmems, sizeof (double)); |
05aabb97 | 781 | (programs + n)->storage_size = nbmems; |
e7d5c144 | 782 | (programs + n)->root = dupelement (root); |
05aabb97 | 783 | } |
c7cbb833 | 784 | |
e7d5c144 | 785 | double call (int id, int nbops, element_t **ops) |
c7cbb833 | 786 | { |
05aabb97 LM |
787 | workspace_t tmp = {0}; |
788 | int i, n = -1; | |
789 | double ret = 0; | |
790 | ||
791 | if (programs) { | |
e7d5c144 LM |
792 | |
793 | /* look for program */ | |
05aabb97 | 794 | for (i = 0; i < nb_programs; i++) { |
e7d5c144 | 795 | if ((programs + i)->id == id) { |
05aabb97 LM |
796 | n = i; |
797 | break; | |
798 | } | |
799 | } | |
05aabb97 LM |
800 | if (n == -1) { |
801 | VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id)); | |
802 | return 0; | |
803 | } | |
804 | ||
805 | /* store context */ | |
806 | tmp.answer = answer; | |
807 | tmp.storage = storage; | |
808 | tmp.storage_size = storage_size; | |
809 | ||
810 | /* change context */ | |
811 | answer = 0; | |
e7d5c144 LM |
812 | storage = (programs + n)->storage; |
813 | storage_size = (programs + n)->storage_size; | |
814 | if (nbops > storage_size) { | |
6f14d1cc LM |
815 | double *tmp = (double *) callocordie (nbops, sizeof (double)); |
816 | memcpy (tmp, storage, storage_size * sizeof (double)); | |
817 | free (storage); | |
818 | storage = tmp; | |
e7d5c144 | 819 | storage_size = nbops; |
05aabb97 | 820 | } |
e7d5c144 LM |
821 | for (i = 0; i < nbops; i++) { |
822 | double val = evaluate_element (ops[i], 0); | |
823 | store (i + 1, val); | |
05aabb97 LM |
824 | } |
825 | ||
826 | /* evaluate program */ | |
e7d5c144 LM |
827 | element_t *elements = dupelement ((programs + n)->root); |
828 | ret = evaluate_element (elements, 0); | |
05aabb97 LM |
829 | |
830 | /* restore context */ | |
831 | answer = tmp.answer; | |
832 | storage = tmp.storage; | |
833 | storage_size = tmp.storage_size; | |
834 | } | |
835 | ||
836 | return ret; | |
c7cbb833 LM |
837 | } |
838 | ||
839 | void list () | |
05aabb97 LM |
840 | { |
841 | int i; | |
842 | if (programs != NULL) { | |
843 | fprintf (stdout, "programs:"); | |
844 | for (i = 0; i < nb_programs; i++) { | |
845 | fprintf (stdout, " %d", (programs + i)->id); | |
846 | } | |
847 | fprintf (stdout, "\n"); | |
848 | } | |
849 | } | |
c7cbb833 LM |
850 | |
851 | void edit (int id) | |
852 | { } | |
853 | ||
854 | void del (int id) | |
855 | { } | |
856 | ||
89cf0955 LM |
857 | /* help message */ |
858 | ||
859 | void help (void) | |
860 | { | |
04d68907 | 861 | fprintf (stdout, "calc is a simple calculator\n\n"); |
94b4e517 LM |
862 | fprintf (stdout, "supported operators:"); |
863 | fprintf (stdout, " + - * / %% ^\n"); | |
864 | fprintf (stdout, "camparison operators:"); | |
865 | fprintf (stdout, " == != >= <= > <\n"); | |
866 | fprintf (stdout, "logical operators:"); | |
867 | fprintf (stdout, " & | !\n"); | |
9e52bbc5 | 868 | fprintf (stdout, "mathematic functions:"); |
b9c1c40d | 869 | fprintf (stdout, " pow sqrt log exp\n"); |
9049369f | 870 | fprintf (stdout, "trig. func.:"); |
b9c1c40d | 871 | fprintf (stdout, " cos sin tan acos asin atan\n"); |
94b4e517 | 872 | fprintf (stdout, "supported functions:"); |
9e52bbc5 | 873 | fprintf (stdout, " abs ceil floor\n"); |
94b4e517 | 874 | fprintf (stdout, "storage functions:"); |
f438579a | 875 | fprintf (stdout, " mem sto rcl inc dec disp\n"); |
9049369f | 876 | fprintf (stdout, "prog. functions:"); |
2d0cd54c | 877 | fprintf (stdout, " cond while print {} ;\n"); |
9049369f | 878 | fprintf (stdout, "misc. functions:"); |
94b4e517 LM |
879 | fprintf (stdout, " quit help\n"); |
880 | fprintf (stdout, "supported constants:"); | |
471da7c9 | 881 | fprintf (stdout, " e pi\n"); |
89cf0955 | 882 | } |
3b4b0bbe | 883 | |
f2927108 LM |
884 | /* evaluate element tree */ |
885 | ||
89cf0955 LM |
886 | #define MASK_SUB 0x1 |
887 | #define MASK_DIV 0x2 | |
888 | ||
3b4b0bbe | 889 | double evaluate_element (element_t *root, char mask) |
f2927108 LM |
890 | { |
891 | double op0 = 0, op1 = 0; | |
3b4b0bbe | 892 | char nextmask = mask; |
e7d5c144 | 893 | int i, nb; |
f2927108 LM |
894 | |
895 | if ((root == NULL) || (root == ERROR_OP)) { | |
04d68907 | 896 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating\n")); |
f2927108 LM |
897 | return 0; |
898 | } | |
899 | ||
3b4b0bbe LM |
900 | /* mask to manage sub operator sub and div */ |
901 | switch (root->func) { | |
902 | case Add: | |
903 | nextmask &= ~MASK_SUB; | |
904 | nextmask &= ~MASK_DIV; | |
905 | break; | |
906 | case Sub: | |
907 | nextmask |= MASK_SUB; | |
908 | nextmask &= ~MASK_DIV; | |
909 | break; | |
910 | case Mul: | |
911 | nextmask &= ~MASK_DIV; | |
912 | break; | |
913 | case Div: | |
914 | nextmask |= MASK_DIV; | |
915 | break; | |
916 | default: | |
917 | nextmask = mask; | |
918 | } | |
919 | ||
f2927108 LM |
920 | switch (root->func) { |
921 | case Val: | |
3b4b0bbe LM |
922 | case Sig: |
923 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], nextmask) : root->value; | |
f2927108 LM |
924 | break; |
925 | case Add: | |
926 | case Sub: | |
927 | case Mul: | |
928 | case Div: | |
c47a9298 | 929 | case Mod: |
f2927108 | 930 | case Pow: |
3639df66 | 931 | case Store: |
7fe742c9 LM |
932 | case Equal: |
933 | case Diff: | |
934 | case Ge: | |
935 | case Le: | |
936 | case Gt: | |
937 | case Lt: | |
ca3e2a2f LM |
938 | case And: |
939 | case Or: | |
c7cbb833 | 940 | case Prog: |
f2927108 | 941 | if (root->ops[1]) { |
3b4b0bbe | 942 | op1 = evaluate_element (root->ops[1], nextmask); |
3639df66 | 943 | } else if (root->func != Store) { |
04d68907 | 944 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[1])\n")); |
f2927108 LM |
945 | return 0; |
946 | } | |
947 | /* fallthrough */ | |
948 | case Sqr: | |
949 | case Cos: | |
950 | case Sin: | |
9e52bbc5 LM |
951 | case Tan: |
952 | case Acos: | |
953 | case Asin: | |
471da7c9 | 954 | case Atan: |
f2927108 LM |
955 | case Log: |
956 | case Exp: | |
9e52bbc5 LM |
957 | case Abs: |
958 | case Ceil: | |
959 | case Floor: | |
6ba1dd0f | 960 | case Recall: |
a8cf32ba LM |
961 | case Inc: |
962 | case Dec: | |
ca3e2a2f | 963 | case Not: |
f438579a | 964 | case Mem: |
94b4e517 | 965 | case Cond: |
c7cbb833 | 966 | case Call: |
c7cbb833 LM |
967 | case Edit: |
968 | case Del: | |
f2927108 | 969 | if (root->ops[0]) { |
3b4b0bbe | 970 | op0 = evaluate_element (root->ops[0], 0); |
f2927108 | 971 | } else { |
04d68907 | 972 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); |
f2927108 LM |
973 | return 0; |
974 | } | |
89cf0955 | 975 | break; |
6ba1dd0f | 976 | case Disp: |
143f91ae | 977 | case Clear: |
471da7c9 LM |
978 | case Quit: |
979 | case Help: | |
5075f6ea | 980 | case Ans: |
471da7c9 LM |
981 | case Pi: |
982 | case E: | |
05aabb97 | 983 | case Code: |
e7d5c144 | 984 | case List: |
09d87cae | 985 | break; |
2a688642 | 986 | case While: |
09d87cae LM |
987 | if (root->ops[0] == NULL) { |
988 | VERBOSE (WARNING, fprintf (stdout, "error while evaluating (op[0])\n")); | |
989 | return 0; | |
990 | } | |
89cf0955 | 991 | break; |
715580ff LM |
992 | case Print: |
993 | op0 = (root->ops[0]) ? evaluate_element (root->ops[0], 0) : answer; | |
994 | break; | |
f2927108 LM |
995 | } |
996 | ||
997 | switch (root->func) { | |
3b4b0bbe LM |
998 | case Val: return op0; |
999 | case Sig: return -op0; | |
1000 | case Add: return ((mask & MASK_SUB) == 0) ? op0 + op1 : op0 - op1; | |
1001 | case Sub: return ((mask & MASK_SUB) == 0) ? op0 - op1 : op0 + op1; | |
1002 | case Mul: return ((mask & MASK_DIV) == 0) ? op0 * op1 : op0 / op1; | |
1003 | case Div: return ((mask & MASK_DIV) == 0) ? op0 / op1 : op0 * op1; | |
c47a9298 | 1004 | case Mod: return fmod (op0, op1); |
f2927108 LM |
1005 | case Pow: return pow (op0, op1); |
1006 | case Sqr: return sqrt (op0); | |
1007 | case Cos: return cos (op0); | |
1008 | case Sin: return sin (op0); | |
9e52bbc5 LM |
1009 | case Tan: return tan (op0); |
1010 | case Acos: return acos (op0); | |
1011 | case Asin: return asin (op0); | |
471da7c9 | 1012 | case Atan: return atan (op0); |
f2927108 LM |
1013 | case Log: return log (op0); |
1014 | case Exp: return exp (op0); | |
9e52bbc5 LM |
1015 | case Abs: return fabs (op0); |
1016 | case Ceil: return ceil (op0); | |
1017 | case Floor: return floor (op0); | |
3639df66 | 1018 | case Store: return store ((int)op0, (op1) ? op1 : answer); |
6ba1dd0f | 1019 | case Recall: return recall ((int)op0); |
a8cf32ba LM |
1020 | case Inc: return increase ((int)op0); |
1021 | case Dec: return decrease ((int)op0); | |
6ba1dd0f | 1022 | case Disp: display (); break; |
f438579a | 1023 | case Mem: memory ((int)op0); break; |
143f91ae | 1024 | case Clear: clear (); break; |
471da7c9 LM |
1025 | case Quit: quit (); break; |
1026 | case Help: help (); break; | |
5075f6ea | 1027 | case Ans: return answer; |
471da7c9 LM |
1028 | case Pi: return M_PI; |
1029 | case E: return M_E; | |
7fe742c9 LM |
1030 | case Equal: return op0 == op1; |
1031 | case Diff: return op0 != op1; | |
1032 | case Ge: return op0 >= op1; | |
1033 | case Le: return op0 <= op1; | |
1034 | case Gt: return op0 > op1; | |
1035 | case Lt: return op0 < op1; | |
ca3e2a2f LM |
1036 | case And: return (op0 != 0) && (op1 != 0); |
1037 | case Or: return (op0 != 0) || (op1 != 0); | |
1038 | case Not: return (op0 == 0); | |
94b4e517 LM |
1039 | case Cond: |
1040 | if ((op0) && (root->ops[1])) { | |
1041 | return evaluate_element (root->ops[1], 0); | |
1042 | } else if ((!op0) && (root->ops[2])) { | |
1043 | return evaluate_element (root->ops[2], 0); | |
1044 | } else { | |
1045 | return 0; | |
1046 | } | |
2a688642 | 1047 | case While: return while_do (root->ops[0], root->ops[1]); |
05aabb97 | 1048 | case Code: return execute_code (root->ops, root->nbops); |
2a5ec9d1 | 1049 | case Print: return print (op0); |
c7cbb833 | 1050 | case Prog: prog ((int)op0, (int)op1, root->ops[2]); break; |
e7d5c144 LM |
1051 | case Call: |
1052 | for (i = 1, nb =0; i < root->nbops; i++) { | |
1053 | if (root->ops[i]) { | |
1054 | nb++; | |
1055 | } | |
1056 | } | |
1057 | return call ((int)op0, nb, root->ops + 1); | |
c7cbb833 LM |
1058 | case List: list (); break; |
1059 | case Edit: edit ((int)op0); break; | |
05aabb97 | 1060 | case Del: del ((int)op0); break; |
f2927108 LM |
1061 | } |
1062 | ||
1063 | return 0; | |
1064 | } | |
1065 | ||
b9c1c40d LM |
1066 | char **generate_completion_list () |
1067 | { | |
db660e60 | 1068 | int i, j, l = 0; |
6f14d1cc | 1069 | char **list = (char **) callocordie (NB_OPERATORS + NB_FUNCTIONS + NB_CONSTANTS + NB_SYMBOLS + 1, sizeof (char *)); |
b9c1c40d | 1070 | |
db660e60 LM |
1071 | for (i = 0; i < NB_OPERATORS; i++) { |
1072 | list[l] = strdup ((operators + i)->keyword); | |
1073 | for (j = 0; j < (int)strlen (list[l]); j++) { | |
1074 | if (list[i][j] == '\t') { | |
1075 | list[i][j] = '\0'; | |
1076 | } | |
1077 | } | |
d8f4df0f LM |
1078 | if (list[l] != NULL) { |
1079 | l++; | |
db660e60 | 1080 | } |
db660e60 LM |
1081 | } |
1082 | ||
b9c1c40d LM |
1083 | for (i = 0; i < NB_FUNCTIONS; i++) { |
1084 | list[l] = strdup ((functions + i)->keyword); | |
d8f4df0f LM |
1085 | if (list[l] != NULL) { |
1086 | l++; | |
b9c1c40d | 1087 | } |
b9c1c40d LM |
1088 | } |
1089 | ||
1090 | for (i = 0; i < NB_CONSTANTS; i++) { | |
1091 | list[l] = strdup ((constants + i)->keyword); | |
d8f4df0f LM |
1092 | if (list[l] != NULL) { |
1093 | l++; | |
b9c1c40d | 1094 | } |
b9c1c40d LM |
1095 | } |
1096 | ||
db660e60 LM |
1097 | for (i = 0; i < NB_SYMBOLS; i++) { |
1098 | list[l] = strdup (symbols[i]); | |
d8f4df0f LM |
1099 | if (list[l] != NULL) { |
1100 | l++; | |
db660e60 | 1101 | } |
db660e60 LM |
1102 | } |
1103 | ||
b9c1c40d LM |
1104 | return (list); |
1105 | } | |
1106 | ||
1107 | void free_completion_list (char **list) | |
1108 | { | |
1109 | int i; | |
1110 | ||
1111 | if (list) { | |
1112 | for (i = 0; i < NB_FUNCTIONS + NB_CONSTANTS; i++) { | |
1113 | if (list[i] != NULL) { | |
1114 | free (list[i]); | |
1115 | } | |
1116 | } | |
1117 | free (list); | |
1118 | } | |
1119 | } | |
1120 | ||
1121 | ||
bc97a989 | 1122 | /* vim: set ts=4 sw=4 et: */ |