1c4099f13d7df7b11da1a4fc99f440df967c9921
[calc.git] / calc.c
1 /* depend: */
2 /* cflags: */
3 /* linker: atoi.o fdprintf.o parser.o */
4
5 //#include <malloc.h>
6 #include <stddef.h>
7 #include <stdio.h>
8 #include <unistd.h>
9
10 #include "atoi.h"
11 #include "debug.h"
12 #include "fdprintf.h"
13 #include "parser.h"
14
15 /* constants */
16
17 //#define BUFFER_SIZE 4096
18 #define BUFFER_SIZE 256
19
20 /* macros */
21
22 #define CEIL(x, y) (((x) + (y) - 1) / (y))
23 #define MIN(x, y) (((x) < (y)) ? (x) : (y))
24 #define MAX(x, y) (((x) > (y)) ? (x) : (y))
25
26 /* gobal variables */
27
28 char *progname = NULL;
29 int verbose = 2;
30
31 /* help function */
32
33 int usage (int ret)
34 {
35 int fd = ret ? stdfderr : stdfdout;
36 fdprintf (fd, "usage: %s\n", progname);
37 fdprintf (fd, " -h : help message\n");
38 fdprintf (fd, " -v : verbose level (%d)\n", verbose);
39
40 return ret;
41 }
42
43 /* main function */
44
45 int main (int argc, char *argv[])
46 {
47 char buffer[BUFFER_SIZE + 1] = {0};
48 char *pt = buffer;
49 int i = 0, j = 0, n;
50
51 /* program name */
52
53 progname = argv[0];
54 while (progname[i] != '\0') {
55 if ((progname[i] == '/') || (progname[i] == '\\')) {
56 progname += i + 1;
57 i = 0;
58 } else {
59 i++;
60 }
61 }
62
63 /* argument processing */
64
65 while (argc-- > 1) {
66 char *arg = *(++argv);
67 if (arg[0] != '-') {
68 PRINTERR ("%s: invalid option -- %s\n", progname, arg);
69 return usage (1);
70 }
71 char c = arg[1];
72 switch (c) {
73 case 'v':
74 arg = (arg[2]) ? arg + 2 : (--argc > 0) ? *(++argv) : NULL;
75 if (arg == NULL) {
76 PRINTERR ("%s: missing verbose level\n", progname);
77 return usage (1);
78 }
79 verbose = atoi (arg);
80 break;
81 case 'h':
82 default:
83 return usage (c != 'h');
84 }
85 }
86
87 /* read from input stream */
88
89 while ((n = read (stdfdin, pt, BUFFER_SIZE - (pt - buffer))) != 0) {
90 VERBOSE (DEBUG, PRINTOUT ("read %d bytes\n", n));
91 n += (pt - buffer);
92 if ((n == 2) && (buffer[0] == '.')) {
93 return 0;
94 }
95
96 /* look for end of line */
97 for (i = 0, j = 0; i < n; i++) {
98 if (buffer[i] == '\n') {
99 buffer[i] = 0;
100 VERBOSE (DEBUG, PRINTOUT ("line(%d): %s\n", j, buffer + j));
101 element_t *element = parser (buffer, NULL);
102 if (element == (void *)(-1)) {
103 VERBOSE (WARNING, PRINTOUT ("error while parsing: %s\n", buffer));
104 } else {
105 print_element (element, 0);
106 }
107 //fsync (stdfdout);
108 j = i + 1;
109 }
110 }
111
112 /* keep remainding */
113 if (j < n) {
114 for (i = 0; i < n - j; i++) {
115 buffer[i] = buffer[i + j];
116 }
117 pt = buffer + n - j;
118 for (i = n - j; i < BUFFER_SIZE; i++) {
119 buffer[i] = 0;
120 }
121 }
122 }
123
124 return 0;
125 }
126
127 // test: calc.exe -h
128 // test: calc.exe -h | awk '/usage:/ { rc=1 } END { exit (1-rc) }'
129 // test: calc.exe -_ 2> /dev/null | awk 'END { if (NR == 0) { exit(0) } else exit (1) }'
130 // test: calc.exe -_ 2>&1 | awk '/usage:/ { rc=1 } END { exit (1-rc) }'
131 // test: echo "foo\nbar\nfoobar" | calc.exe -v3
132
133 /* vim: set ts=4 sw=4 et: */