ed2a4f03a605328dfc0cd9987a2b3742e434fd2a
11 /* global variables */
15 #define DEFAULT_STORAGE_SIZE 10
16 int storage_size
= -1;
17 double *storage
= NULL
;
19 int argument_size
= 0;
20 double *argument
= NULL
;
25 #define DEFAULT_FORMAT "=> %.6g\n"
29 workspace_t
*programs
= NULL
;
34 int codecmp (char *ref
, char *str
)
38 while (*ref
!= '\0') {
40 sig
= (*str
== '.') ? -1 : ((*str
>= '0') && (*str
<= '9'));
45 return (sig
> 0) ? 1 : -1;
54 /* calloc or die function */
56 void *callocordie (size_t count
, size_t size
)
58 if (count
* size
== 0) {
61 void *new = calloc (count
, size
);
63 VERBOSE (ERROR
, fprintf (stderr
, "can't allocate memory\n"));
69 /* allocate new element */
71 element_t
*newelement (func_t function
, int nbops
, int prio
)
73 element_t
*new = (element_t
*) callocordie (1, sizeof (element_t
));
75 new->ops
= (element_t
**) callocordie (nbops
, sizeof (element_t
*));
84 /* desallocate element */
86 void delelement (element_t
*root
)
88 if ((root
!= NULL
) && (root
!= ERROR_OP
)) {
90 for (i
= 0; i
< root
->nbops
; i
++) {
91 delelement (root
->ops
[i
]);
100 /* duplicate element */
102 element_t
*dupelement (element_t
*root
)
104 element_t
*tmp
= NULL
;
107 if ((root
== NULL
) || (root
== ERROR_OP
)) {
110 tmp
= newelement (root
->func
, root
->nbops
, root
->prio
);
111 tmp
->value
= root
->value
;
112 for (i
= 0; i
< root
->nbops
; i
++) {
113 tmp
->ops
[i
] = dupelement (root
->ops
[i
]);
122 #define NB_OPERATORS 14
123 keyword_t operators
[NB_OPERATORS
] = {
124 { "+\t", Add
, 2, 1, 1},
125 { "-\t", Sub
, 2, 1, 1},
126 { "*", Mul
, 2, 1, 2},
127 { "/", Div
, 2, 1, 2},
128 { "%", Mod
, 2, 1, 3},
129 { "^", Pow
, 2, 1, 4},
130 { "==", Equal
, 2, 2, -1},
131 { "!=", Diff
, 2, 2, -1},
132 { ">=", Ge
, 2, 2, -1},
133 { "<=", Le
, 2, 2, -1},
134 { ">", Gt
, 2, 1, -1},
135 { "<", Lt
, 2, 1, -1},
136 { "&", And
, 2, 1, -2},
140 #define NB_FUNCTIONS 42
141 keyword_t functions
[NB_FUNCTIONS
] = {
142 { "sqrt", Sqr
, 1, 4, 5},
143 { "pow", Pow
, 2, 3, 5},
144 { "cos", Cos
, 1, 3, 5},
145 { "sin", Sin
, 1, 3, 5},
146 { "tan", Tan
, 1, 3, 5},
147 { "acos", Acos
, 1, 4, 5},
148 { "asin", Asin
, 1, 4, 5},
149 { "atan", Atan
, 1, 4, 5},
150 { "ln", Ln
, 1, 2, 5},
151 { "log", Log
, 1, 3, 5},
152 { "exp", Exp
, 1, 3, 5},
153 { "erfc", Erfc
, 1, 4, 5},
154 { "erf", Erf
, 1, 3, 5},
155 { "abs", Abs
, 1, 3, 5},
156 { "floor", Floor
, 1, 5, 5},
157 { "ceil", Ceil
, 1, 4, 5},
158 { "sto", Store
, 2, 3, 5},
159 { "rcl", Recall
, 1, 3, 5},
160 { "inc", Inc
, 1, 3, 5},
161 { "dec", Dec
, 1, 3, 5},
162 { "disp", Disp
, 0, 4, 9},
163 { "mem", Mem
, 1, 3, 5},
164 { "clr", Clear
, 0, 3, 9},
165 { "quit", Quit
, 0, 4, 9},
166 { "help", Help
, 0, 4, 9},
167 { "!", Not
, 1, 1, 6},
168 { "cond", Cond
, 3, 4, 5},
169 { "while", While
, 2, 5, 5},
170 { "print", Print
, 1, 5, 5},
171 { "prog", Prog
, 2, 4, 9},
172 { "arg", Arg
, 1, 3, 5},
173 { "call", Call
, MAX_ARGS
, 4, 5},
174 { "ls", List
, 0, 2, 9},
175 { "edit", Edit
, 1, 4, 9},
176 { "del", Del
, 1, 3, 9},
177 { "get", Get
, 1, 3, 5},
178 { "len", Length
, 0, 3, 5},
179 { "pop", Pop
, 0, 3, 5},
180 { "push", Push
, 1, 4, 5},
181 { "put", Put
, 2, 3, 5},
182 { "set", Set
, MAX_ARGS
, 3, 5},
183 { "show", Show
, 0, 4, 5},
186 #define NB_CONSTANTS 3
187 keyword_t constants
[NB_CONSTANTS
] = {
188 { "ans", Ans
, 0, 3, 5},
194 char *symbols
[NB_SYMBOLS
] = {
198 /* subparser function */
200 element_t
*subparser (element_t
**proot
, char **pstr
, func_t func
, int nbops
, int prio
)
202 element_t
*new = newelement (func
, nbops
, prio
);
203 new->ops
[0] = *proot
;
204 new->ops
[1] = parser (*pstr
, pstr
, new->prio
);
205 if ((new->ops
[1] == NULL
) || ((new->ops
[1] != ERROR_OP
) && (new->ops
[1]->prio
== 9))) {
206 delelement (new->ops
[1]);
207 new->ops
[1] = ERROR_OP
;
209 if (new->ops
[1] == ERROR_OP
) {
214 *proot
= newelement (Val
, 1, 5);
215 (*proot
)->ops
[0] = new;
220 /* parser function */
222 element_t
*parser (char *str
, char **next
, int prio
)
224 element_t
*root
= NULL
;
228 VERBOSE (DEBUG
, fprintf (stdout
, "Starting parsing\n"));
231 while (*str
!= '\0') {
233 element_t
*new = NULL
;
234 VERBOSE (INFO
, fprintf (stdout
, "Processing: %s\n", str
));
236 /* end without printing */
245 /* skip spaces and tabs */
247 if ((*str
== ' ') || (*str
== '\t')) {
252 /* check for open brace */
255 VERBOSE (DEBUG
, fprintf (stdout
, "start processing brace\n"));
260 root
= newelement (Code
, 0, 5);
263 new = parser (str
+ 1, &str
, 0);
264 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
268 if (new == ERROR_OP
) {
272 element_t
*newcode
= newelement (Code
, root
->nbops
+ 1, 5);
273 for (i
= 0; i
< root
->nbops
; i
++) {
274 newcode
->ops
[i
] = root
->ops
[i
];
277 newcode
->ops
[root
->nbops
] = new;
280 } while (*str
== ',');
287 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing brace\n"));
291 /* check for open bracket */
294 VERBOSE (DEBUG
, fprintf (stdout
, "start processing bracket\n"));
298 new = parser (str
+ 1, &str
, 0);
299 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
303 if ((new == NULL
) || (new == ERROR_OP
)) {
307 for (i
= 0; i
< root
->nbops
; i
++) {
308 if (root
->ops
[i
] == NULL
) {
319 } while (*str
== ',');
321 root
= newelement (Val
, 1, 5);
322 new = parser (str
+ 1, &str
, 0);
323 if ((new == NULL
) || ((new != ERROR_OP
) && (new->prio
== 9))) {
327 if ((new == NULL
) || (new == ERROR_OP
) || (*str
== ',')) {
339 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing bracket\n"));
343 /* check for closing bracket, closing brace or koma */
345 if ((*str
== ')') || (*str
== '}') || (*str
== ',')) {
356 /* look for operators */
358 for (i
= 0; i
< NB_OPERATORS
; i
++) {
359 keyword_t
*operator = operators
+ i
;
360 if (codecmp (operator->keyword
, str
) == 0) {
361 VERBOSE (DEBUG
, fprintf (stdout
, "start processing operator\n"));
363 if ((prio
) && (prio
> operator->prio
)) {
364 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
368 str
+= operator->offset
;
369 VERBOSE (INFO
, fprintf (stdout
, "Oper: %d\n", operator->func
));
370 if (subparser (&root
, &str
, operator->func
, operator->nbops
, operator->prio
) == ERROR_OP
) {
374 } else if (*str
== '-') {
375 root
= newelement (Sig
, 1, 9);
380 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing operator\n"));
388 /* look for functions */
390 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
391 keyword_t
*function
= functions
+ i
;
392 if (codecmp (function
->keyword
, str
) == 0) {
393 VERBOSE (DEBUG
, fprintf (stdout
, "start processing function\n"));
395 VERBOSE (INFO
, fprintf (stdout
, "Func: %d\n", function
->func
));
396 root
= newelement (function
->func
, function
->nbops
, function
->prio
);
401 str
+= function
->offset
;
403 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing function\n"));
411 /* look for constant */
413 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
414 keyword_t
*constant
= constants
+ i
;
415 if (codecmp (constant
->keyword
, str
) == 0) {
416 VERBOSE (DEBUG
, fprintf (stdout
, "start processing constant\n"));
418 VERBOSE (INFO
, fprintf (stdout
, "Const: %d\n", constant
->func
));
419 root
= newelement (constant
->func
, constant
->nbops
, constant
->prio
);
424 str
+= constant
->offset
;
426 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing constant\n"));
434 /* look for number */
436 if (((*str
>= '0') && (*str
<= '9')) ||
437 (*str
== '.') || (*str
== '+') || (*str
== '-')) {
438 VERBOSE (DEBUG
, fprintf (stdout
, "start processing value\n"));
440 double value
= strtod (str
, &pt
);
441 VERBOSE (INFO
, fprintf (stdout
, "Value: %f\n", value
));
443 if ((root
== NULL
) || (root
->prio
== 6)) {
444 new = newelement (Val
, 1, 5);
449 for (i
= 0; i
< root
->nbops
; i
++) {
450 if (root
->ops
[i
] == NULL
) {
463 } else if ((*str
== '+') || (*str
== '-')) {
464 if ((prio
) && (prio
> 1)) {
465 VERBOSE (DEBUG
, fprintf (stdout
, "stop because operator priority\n"));
469 if (subparser (&root
, &str
, Add
, 2, 1) == ERROR_OP
) {
479 VERBOSE (DEBUG
, fprintf (stdout
, "stop processing value\n"));
497 root
->string
= string
;
503 /* print element tree */
505 void print_element (element_t
*root
, int level
)
510 if ((root
== NULL
) || (root
== ERROR_OP
)) {
514 for (i
= 0; i
< level
; i
++) {
515 fprintf (stdout
, " ");
518 switch (root
->func
) {
519 case Val
: func
= "Value"; break;
520 case Sig
: func
= "Sign"; break;
521 case Add
: func
= "Addition"; break;
522 case Sub
: func
= "Subtraction"; break;
523 case Mul
: func
= "Multiplication"; break;
524 case Div
: func
= "Division"; break;
525 case Mod
: func
= "Modulo"; break;
526 case Pow
: func
= "Power"; break;
527 case Sqr
: func
= "Square Root"; break;
528 case Cos
: func
= "Cosine"; break;
529 case Sin
: func
= "Sine"; break;
530 case Tan
: func
= "Tangent"; break;
531 case Acos
: func
= "Arc Cosine"; break;
532 case Asin
: func
= "Arc Sine"; break;
533 case Atan
: func
= "Arc Tangent"; break;
534 case Ln
: func
= "Logarithm (natural)"; break;
535 case Log
: func
= "Logarithm (10 base)"; break;
536 case Exp
: func
= "Exponantial"; break;
537 case Erfc
: func
= "Complementary Error Function"; break;
538 case Erf
: func
= "Error Function"; break;
539 case Abs
: func
= "Absolute value"; break;
540 case Ceil
: func
= "Ceil value"; break;
541 case Floor
: func
= "Floor value"; break;
542 case Store
: func
= "Store"; break;
543 case Recall
: func
= "Recall"; break;
544 case Inc
: func
= "Increase"; break;
545 case Dec
: func
= "Decrease"; break;
546 case Disp
: func
= "Display"; break;
547 case Mem
: func
= "Memory"; break;
548 case Clear
: func
= "Clear"; break;
549 case Quit
: func
= "Quit"; break;
550 case Help
: func
= "Help"; break;
551 case Ans
: func
= "Ans"; break;
552 case Pi
: func
= "Pi"; break;
553 case E
: func
= "E"; break;
554 case Equal
: func
= "Equal"; break;
555 case Diff
: func
= "Different"; break;
556 case Ge
: func
= "Greater or equal"; break;
557 case Le
: func
= "Lesser or equal"; break;
558 case Gt
: func
= "Greater"; break;
559 case Lt
: func
= "Lesser"; break;
560 case And
: func
= "And"; break;
561 case Or
: func
= "Or"; break;
562 case Not
: func
= "Not"; break;
563 case Cond
: func
= "Condition"; break;
564 case While
: func
= "While"; break;
565 case Code
: func
= "Code"; break;
566 case Print
: func
= "Print"; break;
567 case Prog
: func
= "Program"; break;
568 case Arg
: func
= "Argument"; break;
569 case Call
: func
= "Call"; break;
570 case List
: func
= "List"; break;
571 case Edit
: func
= "Edit"; break;
572 case Del
: func
= "Del"; break;
573 case Get
: func
= "Get"; break;
574 case Length
: func
= "Length"; break;
575 case Pop
: func
= "Pop"; break;
576 case Push
: func
= "Push"; break;
577 case Put
: func
= "Put"; break;
578 case Set
: func
= "Set"; break;
579 case Show
: func
= "Show"; break;
582 fprintf (stdout
, "Function: %s\n", func
);
584 if ((root
->func
== Val
) && (root
->ops
[0] == NULL
)) {
585 for (i
= 0; i
< level
; i
++) {
586 fprintf (stdout
, " ");
588 fprintf (stdout
, "value: %f\n", root
->value
);
590 for (i
= 0; i
< root
->nbops
; i
++) {
591 print_element (root
->ops
[i
], level
+ 1);
596 /* storage functions */
602 if (nb
!= storage_size
) {
603 l
= (nb
< storage_size
) ? nb
: storage_size
;
604 tmp
= (double *) callocordie (nb
, sizeof (double));
605 for (i
= 0; i
< l
; i
++) {
608 if (storage
!= NULL
) {
616 double store (int index
, double value
)
618 if (storage_size
== -1) {
619 memory (DEFAULT_STORAGE_SIZE
);
621 if ((index
> 0) && (index
<= storage_size
)) {
622 storage
[index
- 1] = value
;
624 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
629 double recall (int index
)
631 if (storage_size
== -1) {
632 memory (DEFAULT_STORAGE_SIZE
);
634 if ((index
> 0) && (index
<= storage_size
)) {
635 return storage
[index
- 1];
637 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
642 double increase (int index
)
644 if (storage_size
== -1) {
645 memory (DEFAULT_STORAGE_SIZE
);
647 if ((index
> 0) && (index
<= storage_size
)) {
648 return storage
[index
- 1]++;
650 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
655 double decrease (int index
)
657 if (storage_size
== -1) {
658 memory (DEFAULT_STORAGE_SIZE
);
660 if ((index
> 0) && (index
<= storage_size
)) {
661 return storage
[index
- 1]--;
663 VERBOSE (WARNING
, fprintf (stdout
, "invalid index (%d) [%d, %d]\n", index
, (storage_size
) ? 1 : 0, storage_size
));
671 if (storage_size
== -1) {
672 memory (DEFAULT_STORAGE_SIZE
);
674 fprintf (stdout
, "storage:");
675 for (i
= 0; i
< storage_size
; i
++) {
676 fprintf (stdout
, " ");
677 fprintf (stdout
, minform
, storage
[i
]);
679 fprintf (stdout
, "\n");
685 for (i
= 0; i
< storage_size
; i
++) {
690 /* While do function */
692 double while_do (element_t
*cond
, element_t
*action
)
695 element_t
*temp
= NULL
;
697 VERBOSE (DEBUG
, fprintf (stdout
, "starting while loop\n"));
699 VERBOSE (DEBUG
, fprintf (stdout
, "loop...\n"));
701 temp
= dupelement (cond
);
702 double test
= evaluate_element (temp
, 0);
708 temp
= dupelement (action
);
709 ret
= evaluate_element (temp
, 0);
714 VERBOSE (DEBUG
, fprintf (stdout
, "ending while loop\n"));
719 /* program function */
721 double execute_code (element_t
**prog
, int nbcalls
)
725 for (i
= 0; i
< nbcalls
; i
++) {
726 ret
= evaluate_element (prog
[i
], 0);
733 void set_format (char *prompt
, int precision
)
735 char buffer
[128] = {0};
737 sprintf (buffer
, "%s%%.%dg\n", prompt
, precision
);
738 format
= strdup (buffer
);
739 sprintf (buffer
, "%%.%dg", precision
);
740 minform
= strdup (buffer
);
755 double print (double value
)
757 fprintf (stdout
, format
? format
: DEFAULT_FORMAT
, value
);
766 fprintf (stdout
, "bye\n");
770 /* program function */
772 void prog (int id
, element_t
*root
)
776 if (programs
== NULL
) {
778 /* initial memory allocation */
779 programs
= (workspace_t
*) callocordie (1, sizeof (workspace_t
));
785 /* look for existing program */
786 for (i
= 0; i
< nb_programs
; i
++) {
787 if ((programs
+ i
)->id
== id
) {
796 workspace_t
*tmp
= (workspace_t
*) callocordie (nb_programs
, sizeof (workspace_t
));
797 memcpy (tmp
, programs
, (nb_programs
- 1) * sizeof (workspace_t
));
802 /* clean old program */
803 if ((programs
+ n
)->storage
) {
804 free ((programs
+ n
)->storage
);
806 if ((programs
+ n
)->stack
) {
807 free ((programs
+ n
)->stack
);
809 if ((programs
+ n
)->root
) {
810 delelement ((programs
+ n
)->root
);
812 if ((programs
+ n
)->string
) {
813 free ((programs
+ n
)->string
);
814 (programs
+ n
)->string
= NULL
;
820 (programs
+ n
)->id
= id
;
821 (programs
+ n
)->answer
= 0;
822 (programs
+ n
)->storage
= NULL
;
823 (programs
+ n
)->storage_size
= 0;
824 (programs
+ n
)->stack
= NULL
;
825 (programs
+ n
)->stack_size
= 0;
826 (programs
+ n
)->root
= dupelement (root
);
832 if ((id
<= 0) || (id
> argument_size
)) {
833 VERBOSE (WARNING
, fprintf (stdout
, "error out of bound (%d/%d)\n", id
, argument_size
));
835 ret
= argument
[id
- 1];
840 double call (int id
, int nbargs
, element_t
**args
)
842 workspace_t tmp
= {0};
848 /* look for program */
849 for (i
= 0; i
< nb_programs
; i
++) {
850 if ((programs
+ i
)->id
== id
) {
857 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
863 tmp
.argument
= argument
;
864 tmp
.argument_size
= argument_size
;
865 tmp
.storage
= storage
;
866 tmp
.storage_size
= storage_size
;
868 tmp
.stack_size
= stack_size
;
872 storage
= (programs
+ n
)->storage
;
873 storage_size
= (programs
+ n
)->storage_size
;
876 stack
= (programs
+ n
)->stack
;
877 stack_size
= (programs
+ n
)->stack_size
;
879 argument
= (double *) callocordie (nbargs
, sizeof (double));
880 for (i
= 0, l
= 0; i
< nbargs
; l
++) {
882 argument
[i
++] = evaluate_element (args
[l
], 0);
885 argument_size
= nbargs
;
888 /* evaluate program */
889 element_t
*elements
= dupelement ((programs
+ n
)->root
);
890 ret
= evaluate_element (elements
, 0);
891 delelement (elements
);
892 (programs
+ n
)->answer
= answer
;
893 (programs
+ n
)->storage
= storage
;
894 (programs
+ n
)->storage_size
= storage_size
;
898 (programs
+ n
)->stack
= stack
;
899 (programs
+ n
)->stack_size
= stack_size
;
901 /* restore context */
903 storage
= tmp
.storage
;
904 storage_size
= tmp
.storage_size
;
905 argument
= tmp
.argument
;
906 argument_size
= tmp
.argument_size
;
908 stack_size
= tmp
.stack_size
;
916 fprintf (stdout
, "programs:");
917 for (i
= 0; i
< nb_programs
; i
++) {
918 fprintf (stdout
, " %d", (programs
+ i
)->id
);
920 fprintf (stdout
, "\n");
929 /* look for program */
930 for (i
= 0; i
< nb_programs
; i
++) {
931 if ((programs
+ i
)->id
== id
) {
938 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
942 /* set string program */
943 fprintf (stdout
, "edit: %s\n", (programs
+ n
)->string
);
946 void savestring (int id
, char *string
)
952 /* look for program */
953 for (i
= 0; i
< nb_programs
; i
++) {
954 if ((programs
+ i
)->id
== id
) {
961 /* unnecesary code */
963 // VERBOSE (WARNING, fprintf (stdout, "error unknown program (%d)\n", id));
966 //if ((programs + n)->string) {
967 // free ((programs + n)->string);
970 (programs
+ n
)->string
= strdup (string
);
979 /* look for program */
980 for (i
= 0; i
< nb_programs
; i
++) {
981 if ((programs
+ i
)->id
== id
) {
988 VERBOSE (WARNING
, fprintf (stdout
, "error unknown program (%d)\n", id
));
993 if ((programs
+ n
)->storage
) {
994 free ((programs
+ n
)->storage
);
996 if ((programs
+ n
)->stack
) {
997 free ((programs
+ n
)->stack
);
999 if ((programs
+ n
)->root
) {
1000 delelement ((programs
+ n
)->root
);
1002 if ((programs
+ n
)->string
) {
1003 free ((programs
+ n
)->string
);
1007 workspace_t
*tmp
= (workspace_t
*) callocordie (nb_programs
- 1, sizeof (workspace_t
));
1008 for (i
= 0, j
= 0; i
< nb_programs
; i
++) {
1010 memcpy (tmp
+ j
, programs
+ i
, sizeof (workspace_t
));
1019 /* stack management */
1024 if ((n
<= 0) || (n
> stack_size
)) {
1025 VERBOSE (WARNING
, fprintf (stdout
, "error out of bound (%d/%d)\n", n
, stack_size
));
1040 if (stack_size
> 0) {
1041 ret
= stack
[--stack_size
];
1042 double *tmp
= (double *) callocordie (stack_size
, sizeof (double));
1043 memcpy (tmp
, stack
, stack_size
* sizeof (double));
1047 VERBOSE (WARNING
, fprintf (stdout
, "error stack empty\n"));
1052 double push (double val
)
1054 double *tmp
= (double *) callocordie (stack_size
+ 1, sizeof (double));
1055 memcpy (tmp
, stack
, stack_size
* sizeof (double));
1060 stack
[stack_size
++] = val
;
1064 double put (int n
, double val
)
1067 VERBOSE (WARNING
, fprintf (stdout
, "error out of bound (%d/%d)\n", n
, stack_size
));
1070 if (n
> stack_size
) {
1071 double *tmp
= (double *) callocordie (n
, sizeof (double));
1072 memcpy (tmp
, stack
, stack_size
* sizeof (double));
1081 double set (int nbops
, element_t
**ops
)
1090 stack
= (double *) callocordie (nbops
, sizeof (double));
1091 for (i
= 0; i
< nbops
; i
++) {
1092 stack
[i
] = evaluate_element (ops
[i
], 0);
1102 fprintf (stdout
, "stack:");
1103 for (i
= 0; i
< stack_size
; i
++) {
1104 fprintf (stdout
, " ");
1105 fprintf (stdout
, minform
, stack
[i
]);
1107 fprintf (stdout
, "\n");
1114 fprintf (stdout
, "calc is a simple calculator\n\n");
1115 fprintf (stdout
, "arithmetic op.:");
1116 fprintf (stdout
, " + - * / %% ^\n");
1117 fprintf (stdout
, "comparison op.:");
1118 fprintf (stdout
, " == != >= <= > <\n");
1119 fprintf (stdout
, "logical op.:");
1120 fprintf (stdout
, " & | !\n");
1121 fprintf (stdout
, "mathematic func.:");
1122 fprintf (stdout
, " exp ln log pow sqrt\n");
1123 fprintf (stdout
, "trigonometric func.:");
1124 fprintf (stdout
, " acos asin atan cos sin tan\n");
1125 fprintf (stdout
, "error functions:");
1126 fprintf (stdout
, " erf erfc\n");
1127 fprintf (stdout
, "miscellaneous func.:");
1128 fprintf (stdout
, " abs ceil floor\n");
1129 fprintf (stdout
, "storage func.:");
1130 fprintf (stdout
, " clear dec disp inc mem rcl sto\n");
1131 fprintf (stdout
, "control flow prim.:");
1132 fprintf (stdout
, " cond print while {} ;\n");
1133 fprintf (stdout
, "program management:");
1134 fprintf (stdout
, " arg call del edit ls prog\n");
1135 fprintf (stdout
, "stack management:");
1136 fprintf (stdout
, " get len pop push put set show\n");
1137 fprintf (stdout
, "control management:");
1138 fprintf (stdout
, " help quit\n");
1139 fprintf (stdout
, "constants:");
1140 fprintf (stdout
, " ans e pi\n");
1143 /* evaluate element tree */
1145 #define MASK_SUB 0x1
1146 #define MASK_DIV 0x2
1148 double evaluate_element (element_t
*root
, char mask
)
1150 double op0
= 0, op1
= 0;
1151 char nextmask
= mask
;
1154 if ((root
== NULL
) || (root
== ERROR_OP
)) {
1155 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating\n"));
1159 /* mask to manage sub operator sub and div */
1160 switch (root
->func
) {
1162 nextmask
&= ~MASK_SUB
;
1163 nextmask
&= ~MASK_DIV
;
1166 nextmask
|= MASK_SUB
;
1167 nextmask
&= ~MASK_DIV
;
1170 nextmask
&= ~MASK_DIV
;
1173 nextmask
|= MASK_DIV
;
1179 switch (root
->func
) {
1182 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], nextmask
) : root
->value
;
1200 op1
= evaluate_element (root
->ops
[1], nextmask
);
1201 } else if (root
->func
!= Store
) {
1202 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[1])\n"));
1234 op0
= evaluate_element (root
->ops
[0], 0);
1236 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1255 if (root
->ops
[0] == NULL
) {
1256 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1262 op0
= (root
->ops
[0]) ? evaluate_element (root
->ops
[0], 0) : answer
;
1266 op0
= evaluate_element (root
->ops
[0], 0);
1268 VERBOSE (WARNING
, fprintf (stdout
, "error while evaluating (op[0])\n"));
1271 op1
= (root
->ops
[1]) ? evaluate_element (root
->ops
[1], 0) : answer
;
1275 switch (root
->func
) {
1276 case Val
: return op0
;
1277 case Sig
: return -op0
;
1278 case Add
: return ((mask
& MASK_SUB
) == 0) ? op0
+ op1
: op0
- op1
;
1279 case Sub
: return ((mask
& MASK_SUB
) == 0) ? op0
- op1
: op0
+ op1
;
1280 case Mul
: return ((mask
& MASK_DIV
) == 0) ? op0
* op1
: op0
/ op1
;
1281 case Div
: return ((mask
& MASK_DIV
) == 0) ? op0
/ op1
: op0
* op1
;
1282 case Mod
: return fmod (op0
, op1
);
1283 case Pow
: return pow (op0
, op1
);
1284 case Sqr
: return sqrt (op0
);
1285 case Cos
: return cos (op0
);
1286 case Sin
: return sin (op0
);
1287 case Tan
: return tan (op0
);
1288 case Acos
: return acos (op0
);
1289 case Asin
: return asin (op0
);
1290 case Atan
: return atan (op0
);
1291 case Ln
: return log (op0
);
1292 case Log
: return log10 (op0
);
1293 case Exp
: return exp (op0
);
1294 case Erfc
: return erfc (op0
);
1295 case Erf
: return erf (op0
);
1296 case Abs
: return fabs (op0
);
1297 case Ceil
: return ceil (op0
);
1298 case Floor
: return floor (op0
);
1299 case Store
: return store ((int)op0
, (op1
) ? op1
: answer
);
1300 case Recall
: return recall ((int)op0
);
1301 case Inc
: return increase ((int)op0
);
1302 case Dec
: return decrease ((int)op0
);
1303 case Disp
: display (); break;
1304 case Mem
: memory ((int)op0
); break;
1305 case Clear
: clear (); break;
1306 case Quit
: quit (); break;
1307 case Help
: help (); break;
1308 case Ans
: return answer
;
1309 case Pi
: return M_PI
;
1311 case Equal
: return op0
== op1
;
1312 case Diff
: return op0
!= op1
;
1313 case Ge
: return op0
>= op1
;
1314 case Le
: return op0
<= op1
;
1315 case Gt
: return op0
> op1
;
1316 case Lt
: return op0
< op1
;
1317 case And
: return (op0
!= 0) && (op1
!= 0);
1318 case Or
: return (op0
!= 0) || (op1
!= 0);
1319 case Not
: return (op0
== 0);
1321 if ((op0
) && (root
->ops
[1])) {
1322 return evaluate_element (root
->ops
[1], 0);
1323 } else if ((!op0
) && (root
->ops
[2])) {
1324 return evaluate_element (root
->ops
[2], 0);
1328 case While
: return while_do (root
->ops
[0], root
->ops
[1]);
1329 case Code
: return execute_code (root
->ops
, root
->nbops
);
1330 case Print
: return print (op0
);
1332 prog ((int)op0
, root
->ops
[1]);
1333 savestring ((int)op0
, root
->string
);
1335 case Arg
: return arg ((int)op0
);
1337 for (i
= 1, nb
=0; i
< root
->nbops
; i
++) {
1342 return call ((int)op0
, nb
, root
->ops
+ 1);
1343 case List
: list (); break;
1344 case Edit
: edit ((int)op0
); break;
1345 case Del
: del ((int)op0
); break;
1346 case Get
: return get ((int)op0
);
1347 case Length
: return length ();
1348 case Pop
: return pop ();
1349 case Push
: return push (op0
);
1350 case Put
: return put ((int)op0
, op1
);
1352 for (i
= 0, nb
=0; i
< root
->nbops
; i
++) {
1357 return set (nb
, root
->ops
);
1358 case Show
: show (); break;
1364 char **generate_completion_list ()
1367 char **list
= (char **) callocordie (NB_OPERATORS
+ NB_FUNCTIONS
+ NB_CONSTANTS
+ NB_SYMBOLS
+ 1, sizeof (char *));
1369 for (i
= 0; i
< NB_OPERATORS
; i
++) {
1370 list
[l
] = strdup ((operators
+ i
)->keyword
);
1371 for (j
= 0; j
< (int)strlen (list
[l
]); j
++) {
1372 if (list
[i
][j
] == '\t') {
1376 if (list
[l
] != NULL
) {
1381 for (i
= 0; i
< NB_FUNCTIONS
; i
++) {
1382 list
[l
] = strdup ((functions
+ i
)->keyword
);
1383 if (list
[l
] != NULL
) {
1388 for (i
= 0; i
< NB_CONSTANTS
; i
++) {
1389 list
[l
] = strdup ((constants
+ i
)->keyword
);
1390 if (list
[l
] != NULL
) {
1395 for (i
= 0; i
< NB_SYMBOLS
; i
++) {
1396 list
[l
] = strdup (symbols
[i
]);
1397 if (list
[l
] != NULL
) {
1405 void free_completion_list (char **list
)
1410 for (i
= 0; i
< NB_OPERATORS
+ NB_FUNCTIONS
+ NB_CONSTANTS
+ NB_SYMBOLS
+ 1; i
++) {
1411 if (list
[i
] != NULL
) {
1420 /* vim: set ts=4 sw=4 et: */