f84cf91af829d63256a9a57e7ffe4e72715f6b73
[calc.git] / calc.c
1 /* depend: */
2 /* cflags: */
3 /* linker: debug.o parser.o -lm -lreadline */
4
5 #include <malloc.h>
6 #include <stddef.h>
7 #include <stdio.h>
8 #include <stdlib.h>
9 #include <unistd.h>
10
11 #include <readline/readline.h>
12 #include <readline/history.h>
13
14 #include "debug.h"
15 #include "parser.h"
16
17 /* constants */
18
19 #define BUFFER_SIZE 4096
20 #define HISTORY_LEN 10
21
22 /* macros */
23
24 #define CEIL(x, y) (((x) + (y) - 1) / (y))
25 #define MIN(x, y) (((x) < (y)) ? (x) : (y))
26 #define MAX(x, y) (((x) > (y)) ? (x) : (y))
27
28 /* gobal variables */
29
30 char *progname = NULL;
31 int mode = 1;
32 int precision = 6;
33 char **completion_list = NULL;
34
35 /* help function */
36
37 int usage (int ret)
38 {
39 FILE *fid = ret ? stderr : stdout;
40 fprintf (fid, "usage: %s\n", progname);
41 fprintf (fid, " -h : help message\n");
42 fprintf (fid, " -n : no readline mode (%s)\n", mode ? "yes" : "no");
43 fprintf (fid, " -p : precision (%d)\n", precision);
44 fprintf (fid, " -v : verbose level (%d)\n", verbose);
45
46 return ret;
47 }
48
49 /* main function */
50
51 int main (int argc, char *argv[])
52 {
53 char *buffer = NULL;
54 char buffer_static[BUFFER_SIZE + 1] = {0};
55 int i = 0, nb = 1;
56 int ret = 0;
57
58 /* program name */
59
60 progname = argv[0];
61 while (progname[i] != '\0') {
62 if ((progname[i] == '/') || (progname[i] == '\\')) {
63 progname += i + 1;
64 i = 0;
65 } else {
66 i++;
67 }
68 }
69
70 /* argument processing */
71
72 while (argc-- > 1) {
73 char *arg = *(++argv);
74 if (arg[0] != '-') {
75 VERBOSE (ERROR, fprintf (stderr, "%s: invalid option -- '%s'\n", progname, arg); usage (1));
76 return 1;
77 }
78 char c = arg[1];
79 switch (c) {
80 case 'n':
81 mode = 0;
82 buffer = buffer_static;
83 break;
84 case 'p':
85 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
86 if (arg == NULL) {
87 VERBOSE (ERROR, fprintf (stderr, "%s: missing precision\n", progname); usage (1));
88 return 1;
89 }
90 precision = atoi (arg);
91 break;
92 case 'v':
93 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
94 if (arg == NULL) {
95 VERBOSE (ERROR, fprintf (stderr, "%s: missing verbose level\n", progname); usage (1));
96 return 1;
97 }
98 verbose = atoi (arg);
99 break;
100 case 'h':
101 default:
102 return usage (c != 'h');
103 }
104 }
105
106 /* format */
107 char format[9] = "=> %..g\n";
108 format[5] = '0' + precision;
109
110 /* completion list*/
111 completion_list = generate_completion_list ();
112
113 /* read from input stream */
114
115 while (1) {
116 char *line[BUFFER_SIZE] = {0};
117
118 if (mode) {
119 if ((buffer = readline ("<= ")) == NULL) {
120 break;
121 }
122
123 /* check empty line */
124 if (strlen (buffer) == 0) {
125 free (buffer);
126 continue;
127 } else if (strcmp (buffer, ".") == 0) {
128 break;
129 }
130 line[0] = buffer;
131 nb = 1;
132
133 /* add line into history */
134 add_history (buffer);
135 VERBOSE (INFO, fprintf (stdout, "line (%d/%d): '%s'\n",
136 where_history (), history_length, buffer));
137 if (history_length > HISTORY_LEN) {
138 HIST_ENTRY *last = remove_history (0);
139 if (last) {
140 free_history_entry (last);
141 }
142 }
143 } else {
144 if (read (STDIN_FILENO, buffer, BUFFER_SIZE) == 0) {
145 break;
146 }
147 nb = 0;
148 char *pt = line[nb++] = buffer;
149 while (*pt != '\0') {
150 if (*pt == '\n') {
151 *pt = '\0';
152 line[nb++] = pt + 1;
153 }
154 pt++;
155 }
156 VERBOSE (INFO, fprintf (stdout, "line: '%s'\n", buffer));
157 }
158
159 /* look for end of line */
160 for (i = 0; i < nb; i++) {
161 if (*line[i] == '\0') {
162 continue;
163 }
164 element_t *element = parser (line[i], NULL, -9);
165 if (element == ERROR_OP) {
166 VERBOSE (WARNING, fprintf (stdout, "error while parsing: '%s'\n", line[i]); fflush (stdout));
167 ret = 1;
168 } else if (element != NULL) {
169 VERBOSE (INFO, print_element (element, 0));
170 answer = evaluate_element (element, 0);
171 fprintf (stdout, format, answer);
172 fflush (stdout);
173 delelement (element);
174 ret = 0;
175 }
176 }
177
178 if (mode) {
179 free (buffer);
180 } else {
181 memset (buffer, 0, BUFFER_SIZE);
182 }
183 }
184
185 free_completion_list (completion_list);
186
187 return ret;
188 }
189
190 // test: calc.exe -h
191 // test: calc.exe -h | awk '/usage:/ { rc=1 } END { exit (1-rc) }'
192 // test: echo 1 | calc.exe -v3 | grep -q value
193 // test: calc.exe -_ 2> /dev/null | awk 'END { if (NR == 0) { exit(0) } else exit (1) }'
194 // test: calc.exe -_ 2>&1 | awk '/usage:/ { rc=1 } END { exit (1-rc) }'
195 // test: calc.exe error 2>&1 | grep -q 'invalid option'
196 // test: calc.exe -p 2>&1 | grep -q 'missing precision'
197 // test: calc.exe -v 2>&1 | grep -q 'missing verbose'
198 // test: echo "1 + 2" | calc.exe | grep -q '=> 3'
199 // test: echo "1 - 2" | calc.exe | grep -q '=> -1'
200 // test: echo "2 * 3" | calc.exe | grep -q '=> 6'
201 // test: echo "1 / 2" | calc.exe | grep -q '=> 0\.5'
202 // test: echo "8 % 3" | calc.exe | grep -q '=> 2'
203 // test: echo "-9 % 3.1" | calc.exe | grep -q '=> -2\.8'
204 // test: echo "2 ^ 3" | calc.exe | grep -q '=> 8'
205 // test: echo "1e-1 + 2.34e3" | calc.exe | grep -q '=> 2340\.1'
206 // test: echo "sqrt (2)" | calc.exe | grep -q '=> 1\.41421'
207 // test: echo "pow (2, 3)" | calc.exe | grep -q '=> 8'
208 // test: echo "cos (2)" | calc.exe | grep -q '=> -0\.416147'
209 // test: echo "sin (2)" | calc.exe | grep -q '=> 0\.909297'
210 // test: echo "atan (2)" | calc.exe | grep -q '=> 1\.10715'
211 // test: echo "exp (2)" | calc.exe | grep -q '=> 7\.38906'
212 // test: echo "log (2)" | calc.exe | grep -q '=> 0\.693147'
213 // test: echo "2 + 3 - 4" | calc.exe | grep -q '=> 1'
214 // test: echo "1 + cos (2 - 3)" | calc.exe | grep -q '=> 1\.5403'
215 // test: echo "cos (1 / 2) * 3" | calc.exe | grep -q '=> 2\.63275'
216 // test: echo "1 + 4 * (2 - 3)" | calc.exe | grep -q '=> -3'
217 // test: echo "(2 - 3) / 4" | calc.exe | grep -q '=> -0\.25'
218 // test: echo "pow (8 - 3, 4 / 3)" | calc.exe | grep -q '=> 8\.54988'
219 // test: echo "1 + -2" | calc.exe | grep -q '=> -1'
220 // test: echo "1 - +2" | calc.exe | grep -q '=> -1'
221 // test: echo "-1 + +2" | calc.exe | grep -q '=> 1'
222 // test: echo "-1+2" | calc.exe | grep -q '=> 1'
223 // test: echo "1-2" | calc.exe | grep -q '=> -1'
224 // test: echo "1 * 2 / 3 + 4" | calc.exe | grep -q '=> 4\.66667'
225 // test: echo "2 ^ 3 * 4 + 5" | calc.exe | grep -q '=> 37'
226 // test: echo "2 + 3 * 4 ^ 5" | calc.exe | grep -q '=> 3074'
227 // test: echo "2 ^ 3 * 4 + cos(5/6)" | calc.exe | grep -q '=> 32\.6724'
228 // test: echo "95-6.3*15-1" | calc.exe | grep -q '=> -0.5'
229 // test: echo "95 - 6.3 * 15 - 1" | calc.exe | grep -q '=> -0\.5'
230 // test: echo "95-6.3+15" | calc.exe | grep -q '=> 103.7'
231 // test: echo "-cos (0) + 1" | calc.exe | grep -q '=> -0'
232 // test: echo "-cos(0)+1" | calc.exe | grep -q '=> -0'
233 // test: echo "quit" | calc.exe | grep -q 'bye'
234 // test: echo "help" | calc.exe | grep -q 'miscellaneous'
235 // test: echo "1 + 2 *" | calc.exe | grep -q 'error'
236 // test: echo "* 1 - 2" | calc.exe | grep -q 'error'
237 // test: echo "2 + * 3" | calc.exe | grep -q 'error'
238 // test: echo "2 + cos(3 *)" | calc.exe | grep -q 'error'
239 // test: echo "2 + (foo)" | calc.exe | grep -q 'error'
240 // test: echo "2 + cos (pi +" | calc.exe | grep -q 'error'
241 // test: echo "2 + cos (pi" | calc.exe | grep -q 'error'
242 // test: echo "(2 + " | calc.exe | grep -q 'error'
243 // test: echo "cos (1, 2)" | calc.exe | grep -q 'error'
244 // test: echo "sqrt 2" | calc.exe | grep -q 'error'
245 // test: echo "pow (2)" | calc.exe | grep -q 'error'
246 // test: echo "1.23456789" | calc.exe -p 3 | grep -q '1\.234'
247 // test: echo . | calc.exe
248 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe -n | grep -q 64
249 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe -n | grep -q 2
250 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe | grep -q 64
251 // test: echo -e '1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1 + 1\n1 + 1' | calc.exe | grep -q 2
252 // test: echo -e '-cos (1)\n1 + 1\n1 - 1\n1 * 1\n1 / 1\n3%2\n2^2\nsqrt (2)\ncos (0)\nsin (0)\ntan (0)\nacos (0)\nasin (0)\natan (0)\nlog (1)\nexp (1)\nabs (-1)\nceil (1.2)\nfloor (-1.2)\nans\ne\npi\nsto (1)\nrcl (2)\ndisp\nhelp\nquit' | calc.exe -v 3 | grep -q bye
253 // test: echo -e '1 +\n1 -\n1 * 1\n1 /\n3%\n2^\nsqrt ()\ncos ()\nsin ()\ntan ()\nacos ()\nasin ()\natan ()\nlog ()\nexp ()\nabs ()\nceil ()\nfloor ()\n1 + (\n1+2(\n1+2cos\n1+2pi' | calc.exe | grep -c error | xargs test 21 =
254 // test: echo -e '1 + 1\nans' | calc.exe -p 3 | grep -c 2 | xargs test 2 =
255 // test: echo -e 'sin (pi / 2)' | calc.exe -p 4 | grep -q 1
256 // test: echo -e 'e ^ 2' | calc.exe | grep -q '7\.38906'
257 // test: echo -e '\n\n\n' | calc.exe | grep -qv 'error'
258 // test: echo -e '\n\n\n' | calc.exe -n
259 // test: echo -e '1.5\nsto (2)\n3 + rcl(2) * 4\nsto (5)' | calc.exe | grep -q 9
260 // test: echo -e '1\nsto (0)\nsto (11)\nrcl (0)\nrcl (11)' | calc.exe | grep -c invalid | xargs test 4 =
261 // test: echo -e '1\nsto (2)\n3\nsto (5, 7)\nsto(9)\ndisp' | calc.exe | grep -q '0 1 0 0 7 0 0 0 7 0'
262 // test: echo -e '1+1 == 2' | calc.exe | grep -q '=> 1'
263 // test: echo -e '1 + 1 == 2 - 0' | calc.exe | grep -q '=> 1'
264 // test: echo -e '1 == 1 + 1 == 1' | calc.exe | grep -q '=> 0'
265 // test: echo -e '1-cos(3*pi/4) != 0.5^-2' | calc.exe | grep -q '=> 1'
266 // test: echo -e '1 >= 2' | calc.exe | grep -q '=> 0'
267 // test: echo -e '2 >= 2' | calc.exe | grep -q '=> 1'
268 // test: echo -e '1 <= 2' | calc.exe | grep -q '=> 1'
269 // test: echo -e '2 <= 2' | calc.exe | grep -q '=> 1'
270 // test: echo -e '1 > 2' | calc.exe | grep -q '=> 0'
271 // test: echo -e '2 > 2' | calc.exe | grep -q '=> 0'
272 // test: echo -e '1 < 2' | calc.exe | grep -q '=> 1'
273 // test: echo -e '2 < 2' | calc.exe | grep -q '=> 0'
274 // test: echo -e '1 == 1\n1 != 1\n1 >= 1\n1 <= 1\n1 > 1\n1 < 1\nquit' | calc.exe -v 3 | grep -q bye
275 // test: echo -e '(3 == 3) & (2 > 1)' | calc.exe | grep -q '=> 1'
276 // test: echo -e '(3 == 4) & (2 > 1)' | calc.exe | grep -q '=> 0'
277 // test: echo -e '(3 == 3) & (2 > 2)' | calc.exe | grep -q '=> 0'
278 // test: echo -e '(3 == 4) & (2 > 2)' | calc.exe | grep -q '=> 0'
279 // test: echo -e '(3 == 3) | (2 > 1)' | calc.exe | grep -q '=> 1'
280 // test: echo -e '(3 == 4) | (2 > 1)' | calc.exe | grep -q '=> 1'
281 // test: echo -e '(3 == 3) | (2 > 2)' | calc.exe | grep -q '=> 1'
282 // test: echo -e '(3 == 4) | (2 > 2)' | calc.exe | grep -q '=> 0'
283 // test: echo -e '!(3 == 4)' | calc.exe | grep -q '=> 1'
284 // test: echo -e '!(3 == 3)' | calc.exe | grep -q '=> 0'
285 // test: echo -e '1 & 1\n1 | 1\n!1\nquit' | calc.exe -v 3 | grep -qv error
286 // test: echo -e '(3 == 3) & (4 > 2)' | calc.exe | grep -q '=> 1'
287 // test: echo -e '3 == 3 & 4 > 2' | calc.exe | grep -q '=> 1'
288 // test: echo -e '1 + quit' | calc.exe | grep -q error
289 // test: echo -e 'cos (quit)' | calc.exe | grep -q error
290 // test: echo -e '(quit)' | calc.exe | grep -q error
291 // test: echo -e 'cos 3.14\n!\n! 3 4' | calc.exe | grep -c error | xargs test 3 =
292 // test: echo -e 'sto (2, 3)\ncond (rcl (2) > 2, log (64), exp (75 / 10))' | calc.exe | grep -q '=> 4\.15888'
293 // test: echo -e 'sto (2, 1)\ncond (rcl (2) > 2, log (64), exp (75 / 10))' | calc.exe | grep -q '=> 1808\.04'
294 // test: echo -e 'sto (2, 1)\ncond (rcl (2) > 2, log (64))' | calc.exe | grep -q '=> 0'
295 // test: echo -e 'cond (0, 1, 2)' | calc.exe -v 3 | grep -q Cond
296 // test: echo -e 'cond\ncond (\ncond (1 >0,'| calc.exe | grep -c error | xargs test 3 =
297 // test: echo -e 'sto (1, 4)\ninc (1)\ninc (1)\ndec (1)\ninc (1)\nrcl (1) == 6' | calc.exe -v 3 | grep -q '=> 1'
298 // test: echo -e 'inc\ninc (\ndec\ndec (' | calc.exe | grep -c error | xargs test 4 =
299 // test: echo -e 'inc (11)\ndec (0)' | calc.exe | grep -c invalid | xargs test 2 =
300 // test: echo -e 'while (inc (1) < 100, sto (2, rcl (1) + rcl (2)))' | calc.exe | grep -q '=> 5050'
301 // test: echo -e 'while\nwhile (inc (1) < 3,\nwhile (inc (1) < 100, sto (2, rcl (1) + rcl (2))' | calc.exe | grep -c error | xargs test 3 =
302 // test: echo -e 'while (0, 1)' | calc.exe -v 3 | grep -q While
303 // test: echo -e '{sto (1, 1 + 1), rcl (1) * 3}' | calc.exe -v 3 | grep -q 'Program'
304 // test: echo -e '{sto (1, 1 + 1), rcl (1) * 3}' | calc.exe | grep -q '=> 6'
305 // test: echo -e '{\n{}\n{1, 2\n{sto (1, 1 + 1),\npow(2, {sto (1, 1 + 2), 2}, {rcl(2)})\n2 {sto (1, 1 + 1)}' | calc.exe | grep -c error | xargs test 6 =
306 // test: echo -e '1 }\n1 )\n1 , 2\n ' | calc.exe | grep -c error | xargs test 3 =
307
308 // Fibonacci sequence
309 // test: echo -e '{sto (1, 1), sto (2, 1), sto (10, 1), while (inc (10) < 12 - 1, {sto (3, rcl (1) + rcl (2)), sto (1, rcl (2)), sto (2, rcl (3))})}' | calc.exe | grep '=> 144'
310
311 /* vim: set ts=4 sw=4 et: */