11 /* global variables */
15 #define DEFAULT_STORAGE_SIZE 10
16 int storage_size
= -1;
18 double *storage
= NULL
;
20 #define DEFAULT_FORMAT "=> %.6g\n"
24 workspace_t
*programs
= NULL
;
29 int codecmp (char *ref
, char *str
)
33 while (*ref
!= '\0') {
35 sig
= (*str
== '.') ? -1 : ((*str
>= '0') && (*str
<= '9'));
40 return (sig
> 0) ? 1 : -1;
49 /* calloc or die function */
51 void *callocordie (size_t count
, size_t size
)
53 if (count
* size
== 0) {
56 void *new = calloc (count
, size
);
58 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
64 /* allocate new element */
66 element_t
*newelement (func_t function
, int nbops
, int prio
)
68 element_t
*new = (element_t
*) callocordie (1, sizeof (element_t
));
70 new->ops
= (element_t
**) callocordie (nbops
, sizeof (element_t
*));
79 /* desallocate element */
81 void delelement (element_t
*root
)
83 if ((root
!= NULL
) && (root
!= ERROR_OP
)) {
85 for (i
= 0; i
< root
->nbops
; i
++) {
86 if ((root
->ops
[i
] != NULL
) && (root
->ops
[i
] != ERROR_OP
)) {
87 delelement (root
->ops
[i
]);
97 /* duplicate element */
99 element_t
*dupelement (element_t
*root
)
101 element_t
*tmp
= NULL
;
104 if ((root
== NULL
) || (root
== ERROR_OP
)) {
107 tmp
= newelement (root
->func
, root
->nbops
, root
->prio
);
108 tmp
->value
= root
->value
;
109 for (i
= 0; i
< root
->nbops
; i
++) {
110 tmp
->ops
[i
] = dupelement (root
->ops
[i
]);
117 #define NB_OPERATORS 14
118 keyword_t operators
[NB_OPERATORS
] = {
119 { "+\t", Add
, 2, 1, 1},
120 { "-\t", Sub
, 2, 1, 1},
121 { "*", Mul
, 2, 1, 2},
122 { "/", Div
, 2, 1, 2},
123 { "%", Mod
, 2, 1, 3},
124 { "^", Pow
, 2, 1, 4},
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},
135 #define NB_FUNCTIONS 31
136 keyword_t functions
[NB_FUNCTIONS
] = {
137 { "sqrt", Sqr
, 1, 4, 5},
138 { "pow", Pow
, 2, 3, 5},
139 { "cos", Cos
, 1, 3, 5},
140 { "sin", Sin
, 1, 3, 5},
141 { "tan", Tan
, 1, 3, 5},
142 { "acos", Acos
, 1, 4, 5},
143 { "asin", Asin
, 1, 4, 5},
144 { "atan", Atan
, 1, 4, 5},
145 { "log", Log
, 1, 3, 5},
146 { "exp", Exp
, 1, 3, 5},
147 { "abs", Abs
, 1, 3, 5},
148 { "floor", Floor
, 1, 5, 5},
149 { "ceil", Ceil
, 1, 4, 5},
150 { "sto", Store
, 2, 3, 5},
151 { "rcl", Recall
, 1, 3, 5},
152 { "inc", Inc
, 1, 3, 5},
153 { "dec", Dec
, 1, 3, 5},
154 { "disp", Disp
, 0, 4, 9},
155 { "mem", Mem
, 1, 3, 9},
156 { "clr", Clear
, 0, 3, 9},
157 { "quit", Quit
, 0, 4, 9},
158 { "help", Help
, 0, 4, 9},
159 { "!", Not
, 1, 1, 6},
160 { "cond", Cond
, 3, 4, 5},
161 { "while", While
, 2, 5, 5},
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}
170 #define NB_CONSTANTS 3
171 keyword_t constants
[NB_CONSTANTS
] = {
172 { "ans", Ans
, 0, 3, 5},
178 char *symbols
[NB_SYMBOLS
] = {
182 /* subparser function */
184 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
186 element_t
*new = newelement (func
, nbops
, prio
);
187 new->ops
[0] = *proot
;
188 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
189 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
190 delelement (new->ops
[1]);
191 new->ops
[1] = ERROR_OP
;
193 if (new->ops
[1] == ERROR_OP
) {
198 *proot
= newelement (Val
, 1, 5);
199 (*proot
)->ops
[0] = new;
204 /* parser function */
206 element_t
*parser (char *str
, char **next
, int prio
)
208 element_t
*root
= NULL
;
212 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
215 while (*str
!= '\0') {
217 element_t
*new = NULL
;
218 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
220 /* end without printing */
229 /* skip spaces and tabs */
231 if ((*str
== ' ') || (*str
== '\t')) {
236 /* check for open brace */
239 VERBOSE (DEBUG
, fprintf (stdout
, "start processing brace\n"));
244 element_t
**prog
= NULL
;
245 new = newelement (Code
, 0, 5);
250 new = parser (str
+ 1, &str
, 0);
251 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
255 if (new == ERROR_OP
) {
259 element_t
*newprog
= newelement (Code
, (*prog
)->nbops
+ 1, 5);
260 for (i
= 0; i
< (*prog
)->nbops
; i
++) {
261 newprog
->ops
[i
] = (*prog
)->ops
[i
];
262 (*prog
)->ops
[i
] = NULL
;
264 newprog
->ops
[(*prog
)->nbops
] = new;
267 } while (*str
== ',');
274 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing brace\n"));
278 /* check for open bracket */
281 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
285 new = parser (str
+ 1, &str
, 0);
286 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
290 if ((new == NULL
) || (new == ERROR_OP
)) {
294 for (i
= 0; i
< root
->nbops
; i
++) {
295 if (root
->ops
[i
] == NULL
) {
306 } while (*str
== ',');
308 root
= newelement (Val
, 1, 5);
309 new = parser (str
+ 1, &str
, 0);
310 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
314 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
326 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
330 /* check for closing bracket, closing brace or koma */
332 if ((*str
== ')') || (*str
== '}') || (*str
== ',')) {
343 /* look for operators */
345 for (i
= 0; i
< NB_OPERATORS
; i
++) {
346 keyword_t
*operator = operators
+ i
;
347 if (codecmp (operator->keyword
, str
) == 0) {
348 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
350 if ((prio
) && (prio
> operator->prio
)) {
351 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
355 str
+= operator->offset
;
356 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
357 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
361 } else if (*str
== '-') {
362 root
= newelement (Sig
, 1, 9);
367 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
375 /* look for functions */
377 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
378 keyword_t
*function
= functions
+ i
;
379 if (codecmp (function
->keyword
, str
) == 0) {
380 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
382 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
383 root
= newelement (function
->func
, function
->nbops
, function
->prio
);
388 str
+= function
->offset
;
390 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
398 /* look for constant */
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"));
405 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
406 root
= newelement (constant
->func
, constant
->nbops
, constant
->prio
);
411 str
+= constant
->offset
;
413 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
421 /* look for number */
423 if (((*str
>= '0') && (*str
<= '9')) ||
424 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
425 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
427 double value
= strtod (str
, &pt
);
428 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
430 if ((root
== NULL
) || (root
->prio
== 6)) {
431 new = newelement (Val
, 1, 5);
436 for (i
= 0; i
< root
->nbops
; i
++) {
437 if (root
->ops
[i
] == NULL
) {
450 } else if ((*str
== '+') || (*str
== '-')) {
451 if ((prio
) && (prio
> 1)) {
452 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
456 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
466 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
484 root
->string
= string
;
490 /* print element tree */
492 void print_element (element_t
*root
, int level
)
497 if ((root
== NULL
) || (root
== ERROR_OP
)) {
501 for (i
= 0; i
< level
; i
++) {
502 fprintf (stdout
, " ");
505 switch (root
->func
) {
506 case Val
: func
= "Value"; break;
507 case Sig
: func
= "Sign"; break;
508 case Add
: func
= "Addition"; break;
509 case Sub
: func
= "Subtraction"; break;
510 case Mul
: func
= "Multiplication"; break;
511 case Div
: func
= "Division"; break;
512 case Mod
: func
= "Modulo"; break;
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;
517 case Tan
: func
= "Tangent"; break;
518 case Acos
: func
= "Arc Cosine"; break;
519 case Asin
: func
= "Arc Sine"; break;
520 case Atan
: func
= "Arc Tangent"; break;
521 case Log
: func
= "Logarithm"; break;
522 case Exp
: func
= "Exponantial"; break;
523 case Abs
: func
= "Absolute value"; break;
524 case Ceil
: func
= "Ceil value"; break;
525 case Floor
: func
= "Floor value"; break;
526 case Store
: func
= "Store"; break;
527 case Recall
: func
= "Recall"; break;
528 case Inc
: func
= "Increase"; break;
529 case Dec
: func
= "Decrease"; break;
530 case Disp
: func
= "Display"; break;
531 case Mem
: func
= "Memory"; break;
532 case Clear
: func
= "Clear"; break;
533 case Quit
: func
= "Quit"; break;
534 case Help
: func
= "Help"; break;
535 case Ans
: func
= "Ans"; break;
536 case Pi
: func
= "Pi"; break;
537 case E
: func
= "E"; break;
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;
544 case And
: func
= "And"; break;
545 case Or
: func
= "Or"; break;
546 case Not
: func
= "Not"; break;
547 case Cond
: func
= "Condition"; break;
548 case While
: func
= "While"; break;
549 case Code
: func
= "Code"; break;
550 case Print
: func
= "Print"; break;
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;
558 fprintf (stdout
, "Function: %s\n", func
);
560 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
561 for (i
= 0; i
< level
; i
++) {
562 fprintf (stdout
, " ");
564 fprintf (stdout
, "value: %f\n", root
->value
);
566 for (i
= 0; i
< root
->nbops
; i
++) {
567 print_element (root
->ops
[i
], level
+ 1);
572 /* storage functions */
578 if (nb
!= storage_size
) {
579 l
= (nb
< storage_size
) ? nb
: storage_size
;
580 tmp
= (double *) callocordie (nb
, sizeof (double));
581 for (i
= 0; i
< l
; i
++) {
584 if (storage
!= NULL
) {
592 double store (int index
, double value
)
594 if (storage_size
== -1) {
595 memory (DEFAULT_STORAGE_SIZE
);
597 if ((index
> 0) && (index
<= storage_size
)) {
598 storage
[index
- 1] = value
;
600 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
605 double recall (int index
)
607 if (storage_size
== -1) {
608 memory (DEFAULT_STORAGE_SIZE
);
610 if ((index
> 0) && (index
<= storage_size
)) {
611 return storage
[index
- 1];
613 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
618 double increase (int index
)
620 if (storage_size
== -1) {
621 memory (DEFAULT_STORAGE_SIZE
);
623 if ((index
> 0) && (index
<= storage_size
)) {
624 return storage
[index
- 1]++;
626 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
631 double decrease (int index
)
633 if (storage_size
== -1) {
634 memory (DEFAULT_STORAGE_SIZE
);
636 if ((index
> 0) && (index
<= storage_size
)) {
637 return storage
[index
- 1]--;
639 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
647 if (storage_size
== -1) {
648 memory (DEFAULT_STORAGE_SIZE
);
650 fprintf (stdout
, "storage:");
651 for (i
= 0; i
< storage_size
; i
++) {
652 fprintf (stdout
, " ");
653 fprintf (stdout
, minform
, storage
[i
]);
655 fprintf (stdout
, "\n");
661 for (i
= 0; i
< storage_size
; i
++) {
666 /* While do function */
668 double while_do (element_t
*cond
, element_t
*action
)
671 element_t
*temp
= NULL
;
673 VERBOSE (DEBUG
, fprintf (stdout
, "starting while loop\n"));
675 VERBOSE (DEBUG
, fprintf (stdout
, "loop...\n"));
677 temp
= dupelement (cond
);
678 if (!evaluate_element (temp
, 0)) {
682 temp
= dupelement (action
);
683 ret
= evaluate_element (temp
, 0);
687 VERBOSE (DEBUG
, fprintf (stdout
, "ending while loop\n"));
692 /* program function */
694 double execute_code (element_t
**prog
, int nbcalls
)
698 for (i
= 0; i
< nbcalls
; i
++) {
699 ret
= evaluate_element (prog
[i
], 0);
707 void set_format (char *prompt
, int precision
)
709 char buffer
[128] = {0};
711 sprintf (buffer
, "%s%%.%dg\n", prompt
, precision
);
712 format
= strdup (buffer
);
713 sprintf (buffer
, "%%.%dg", precision
);
714 minform
= strdup (buffer
);
729 double print (double value
)
731 fprintf (stdout
, format
? format
: DEFAULT_FORMAT
, value
);
740 fprintf (stdout
, "bye\n");
744 /* program function */
746 void prog (int id
, int nbmems
, element_t
*root
)
750 if (programs
== NULL
) {
752 /* initial memory allocation */
753 programs
= (workspace_t
*) callocordie (1, sizeof (workspace_t
));
759 /* look for existing program */
760 for (i
= 0; i
< nb_programs
; i
++) {
761 if ((programs
+ i
)->id
== id
) {
770 workspace_t
*tmp
= (workspace_t
*) callocordie (nb_programs
, sizeof (workspace_t
));
771 memcpy (tmp
, programs
, (nb_programs
- 1) * sizeof (workspace_t
));
776 /* clean old program */
777 if ((programs
+ n
)->storage
) {
778 free ((programs
+ n
)->storage
);
780 if ((programs
+ n
)->root
) {
781 delelement ((programs
+ n
)->root
);
783 if ((programs
+ n
)->string
) {
784 free ((programs
+ n
)->string
);
785 (programs
+ n
)->string
= NULL
;
791 (programs
+ n
)->id
= id
;
792 (programs
+ n
)->answer
= 0;
793 (programs
+ n
)->storage
= (double *) callocordie (nbmems
, sizeof (double));
794 (programs
+ n
)->storage_size
= nbmems
;
795 (programs
+ n
)->root
= dupelement (root
);
798 double call (int id
, int nbops
, element_t
**ops
)
800 workspace_t tmp
= {0};
806 /* look for program */
807 for (i
= 0; i
< nb_programs
; i
++) {
808 if ((programs
+ i
)->id
== id
) {
815 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
821 tmp
.storage
= storage
;
822 tmp
.storage_size
= storage_size
;
826 storage
= (programs
+ n
)->storage
;
827 storage_size
= (programs
+ n
)->storage_size
;
828 if (nbops
> storage_size
) {
829 double *tmp
= (double *) callocordie (nbops
, sizeof (double));
830 memcpy (tmp
, storage
, storage_size
* sizeof (double));
833 storage_size
= nbops
;
835 for (i
= 0; i
< nbops
; i
++) {
836 double val
= evaluate_element (ops
[i
], 0);
840 /* evaluate program */
841 element_t
*elements
= dupelement ((programs
+ n
)->root
);
842 ret
= evaluate_element (elements
, 0);
844 /* restore context */
846 storage
= tmp
.storage
;
847 storage_size
= tmp
.storage_size
;
855 fprintf (stdout
, "programs:");
856 for (i
= 0; i
< nb_programs
; i
++) {
857 fprintf (stdout
, " %d", (programs
+ i
)->id
);
859 fprintf (stdout
, "\n");
868 /* look for program */
869 for (i
= 0; i
< nb_programs
; i
++) {
870 if ((programs
+ i
)->id
== id
) {
877 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
881 /* set string program */
882 fprintf (stdout
, "edit: %s\n", (programs
+ n
)->string
);
885 void savestring (int id
, char *string
)
891 /* look for program */
892 for (i
= 0; i
< nb_programs
; i
++) {
893 if ((programs
+ i
)->id
== id
) {
900 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
905 if ((programs
+ n
)->string
) {
906 free ((programs
+ n
)->string
);
908 (programs
+ n
)->string
= strdup (string
);
917 /* look for program */
918 for (i
= 0; i
< nb_programs
; i
++) {
919 if ((programs
+ i
)->id
== id
) {
926 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
931 if ((programs
+ n
)->storage
) {
932 free ((programs
+ n
)->storage
);
934 if ((programs
+ n
)->root
) {
935 delelement ((programs
+ n
)->root
);
937 if ((programs
+ n
)->string
) {
938 free ((programs
+ n
)->string
);
942 workspace_t
*tmp
= (workspace_t
*) callocordie (nb_programs
- 1, sizeof (workspace_t
));
943 for (i
= 0, j
= 0; i
< nb_programs
; i
++) {
945 memcpy (tmp
+ j
, programs
+ i
, sizeof (workspace_t
));
958 fprintf (stdout
, "calc is a simple calculator\n\n");
959 fprintf (stdout
, "supported operators:");
960 fprintf (stdout
, " + - * / %% ^\n");
961 fprintf (stdout
, "camparison operators:");
962 fprintf (stdout
, " == != >= <= > <\n");
963 fprintf (stdout
, "logical operators:");
964 fprintf (stdout
, " & | !\n");
965 fprintf (stdout
, "mathematic functions:");
966 fprintf (stdout
, " pow sqrt log exp\n");
967 fprintf (stdout
, "trig. func.:");
968 fprintf (stdout
, " cos sin tan acos asin atan\n");
969 fprintf (stdout
, "supported functions:");
970 fprintf (stdout
, " abs ceil floor\n");
971 fprintf (stdout
, "storage functions:");
972 fprintf (stdout
, " mem sto rcl inc dec disp\n");
973 fprintf (stdout
, "prog. functions:");
974 fprintf (stdout
, " cond while print {} ;\n");
975 fprintf (stdout
, "misc. functions:");
976 fprintf (stdout
, " quit help\n");
977 fprintf (stdout
, "supported constants:");
978 fprintf (stdout
, " e pi\n");
981 /* evaluate element tree */
986 double evaluate_element (element_t
*root
, char mask
)
988 double op0
= 0, op1
= 0;
989 char nextmask
= mask
;
992 if ((root
== NULL
) || (root
== ERROR_OP
)) {
993 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
997 /* mask to manage sub operator sub and div */
998 switch (root
->func
) {
1000 nextmask
&= ~MASK_SUB
;
1001 nextmask
&= ~MASK_DIV
;
1004 nextmask
|= MASK_SUB
;
1005 nextmask
&= ~MASK_DIV
;
1008 nextmask
&= ~MASK_DIV
;
1011 nextmask
|= MASK_DIV
;
1017 switch (root
->func
) {
1020 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
1039 op1
= evaluate_element (root
->ops
[1], nextmask
);
1040 } else if (root
->func
!= Store
) {
1041 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
1067 op0
= evaluate_element (root
->ops
[0], 0);
1069 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1084 if (root
->ops
[0] == NULL
) {
1085 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1090 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : answer
;
1094 switch (root
->func
) {
1095 case Val
: return op0
;
1096 case Sig
: return -op0
;
1097 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
1098 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
1099 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
1100 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
1101 case Mod
: return fmod (op0
, op1
);
1102 case Pow
: return pow (op0
, op1
);
1103 case Sqr
: return sqrt (op0
);
1104 case Cos
: return cos (op0
);
1105 case Sin
: return sin (op0
);
1106 case Tan
: return tan (op0
);
1107 case Acos
: return acos (op0
);
1108 case Asin
: return asin (op0
);
1109 case Atan
: return atan (op0
);
1110 case Log
: return log (op0
);
1111 case Exp
: return exp (op0
);
1112 case Abs
: return fabs (op0
);
1113 case Ceil
: return ceil (op0
);
1114 case Floor
: return floor (op0
);
1115 case Store
: return store ((int)op0
, (op1
) ? op1
: answer
);
1116 case Recall
: return recall ((int)op0
);
1117 case Inc
: return increase ((int)op0
);
1118 case Dec
: return decrease ((int)op0
);
1119 case Disp
: display (); break;
1120 case Mem
: memory ((int)op0
); break;
1121 case Clear
: clear (); break;
1122 case Quit
: quit (); break;
1123 case Help
: help (); break;
1124 case Ans
: return answer
;
1125 case Pi
: return M_PI
;
1127 case Equal
: return op0
== op1
;
1128 case Diff
: return op0
!= op1
;
1129 case Ge
: return op0
>= op1
;
1130 case Le
: return op0
<= op1
;
1131 case Gt
: return op0
> op1
;
1132 case Lt
: return op0
< op1
;
1133 case And
: return (op0
!= 0) && (op1
!= 0);
1134 case Or
: return (op0
!= 0) || (op1
!= 0);
1135 case Not
: return (op0
== 0);
1137 if ((op0
) && (root
->ops
[1])) {
1138 return evaluate_element (root
->ops
[1], 0);
1139 } else if ((!op0
) && (root
->ops
[2])) {
1140 return evaluate_element (root
->ops
[2], 0);
1144 case While
: return while_do (root
->ops
[0], root
->ops
[1]);
1145 case Code
: return execute_code (root
->ops
, root
->nbops
);
1146 case Print
: return print (op0
);
1148 prog ((int)op0
, (int)op1
, root
->ops
[2]);
1149 savestring ((int)op0
, root
->string
);
1152 for (i
= 1, nb
=0; i
< root
->nbops
; i
++) {
1157 return call ((int)op0
, nb
, root
->ops
+ 1);
1158 case List
: list (); break;
1159 case Edit
: edit ((int)op0
); break;
1160 case Del
: del ((int)op0
); break;
1166 char **generate_completion_list ()
1169 char **list
= (char **) callocordie (NB_OPERATORS
+ NB_FUNCTIONS
+ NB_CONSTANTS
+ NB_SYMBOLS
+ 1, sizeof (char *));
1171 for (i
= 0; i
< NB_OPERATORS
; i
++) {
1172 list
[l
] = strdup ((operators
+ i
)->keyword
);
1173 for (j
= 0; j
< (int)strlen (list
[l
]); j
++) {
1174 if (list
[i
][j
] == '\t') {
1178 if (list
[l
] != NULL
) {
1183 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
1184 list
[l
] = strdup ((functions
+ i
)->keyword
);
1185 if (list
[l
] != NULL
) {
1190 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
1191 list
[l
] = strdup ((constants
+ i
)->keyword
);
1192 if (list
[l
] != NULL
) {
1197 for (i
= 0; i
< NB_SYMBOLS
; i
++) {
1198 list
[l
] = strdup (symbols
[i
]);
1199 if (list
[l
] != NULL
) {
1207 void free_completion_list (char **list
)
1212 for (i
= 0; i
< NB_FUNCTIONS
+ NB_CONSTANTS
; i
++) {
1213 if (list
[i
] != NULL
) {
1222 /* vim: set ts=4 sw=4 et: */