db_lex.c revision 1.13 1 1.13 soren /* $NetBSD: db_lex.c,v 1.13 2000/06/06 18:50:56 soren Exp $ */
2 1.4 cgd
3 1.1 cgd /*
4 1.1 cgd * Mach Operating System
5 1.1 cgd * Copyright (c) 1991,1990 Carnegie Mellon University
6 1.1 cgd * All Rights Reserved.
7 1.1 cgd *
8 1.1 cgd * Permission to use, copy, modify and distribute this software and its
9 1.1 cgd * documentation is hereby granted, provided that both the copyright
10 1.1 cgd * notice and this permission notice appear in all copies of the
11 1.1 cgd * software, derivative works or modified versions, and any portions
12 1.1 cgd * thereof, and that both notices appear in supporting documentation.
13 1.1 cgd *
14 1.11 pk * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS "AS IS"
15 1.1 cgd * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
16 1.1 cgd * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
17 1.1 cgd *
18 1.1 cgd * Carnegie Mellon requests users of this software to return to
19 1.1 cgd *
20 1.1 cgd * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
21 1.1 cgd * School of Computer Science
22 1.1 cgd * Carnegie Mellon University
23 1.1 cgd * Pittsburgh PA 15213-3890
24 1.1 cgd *
25 1.1 cgd * any improvements or extensions that they make and grant Carnegie the
26 1.1 cgd * rights to redistribute these changes.
27 1.2 cgd *
28 1.1 cgd * Author: David B. Golub, Carnegie Mellon University
29 1.1 cgd * Date: 7/90
30 1.1 cgd */
31 1.3 mycroft
32 1.1 cgd /*
33 1.1 cgd * Lexical analyzer.
34 1.1 cgd */
35 1.5 mycroft #include <sys/param.h>
36 1.13 soren #include <sys/systm.h>
37 1.5 mycroft
38 1.8 christos #include <machine/db_machdep.h>
39 1.8 christos
40 1.1 cgd #include <ddb/db_lex.h>
41 1.8 christos #include <ddb/db_output.h>
42 1.8 christos #include <ddb/db_command.h>
43 1.8 christos #include <ddb/db_sym.h>
44 1.8 christos #include <ddb/db_extern.h>
45 1.1 cgd
46 1.1 cgd char db_line[120];
47 1.1 cgd char * db_lp, *db_endlp;
48 1.1 cgd
49 1.1 cgd int
50 1.1 cgd db_read_line()
51 1.1 cgd {
52 1.1 cgd int i;
53 1.1 cgd
54 1.1 cgd i = db_readline(db_line, sizeof(db_line));
55 1.1 cgd if (i == 0)
56 1.1 cgd return (0); /* EOI */
57 1.1 cgd db_lp = db_line;
58 1.1 cgd db_endlp = db_lp + i;
59 1.1 cgd return (i);
60 1.1 cgd }
61 1.1 cgd
62 1.1 cgd void
63 1.1 cgd db_flush_line()
64 1.1 cgd {
65 1.1 cgd db_lp = db_line;
66 1.1 cgd db_endlp = db_line;
67 1.1 cgd }
68 1.1 cgd
69 1.1 cgd int db_look_char = 0;
70 1.1 cgd
71 1.1 cgd int
72 1.1 cgd db_read_char()
73 1.1 cgd {
74 1.1 cgd int c;
75 1.1 cgd
76 1.1 cgd if (db_look_char != 0) {
77 1.1 cgd c = db_look_char;
78 1.1 cgd db_look_char = 0;
79 1.1 cgd }
80 1.1 cgd else if (db_lp >= db_endlp)
81 1.1 cgd c = -1;
82 1.1 cgd else
83 1.1 cgd c = *db_lp++;
84 1.1 cgd return (c);
85 1.1 cgd }
86 1.1 cgd
87 1.1 cgd void
88 1.1 cgd db_unread_char(c)
89 1.5 mycroft int c;
90 1.1 cgd {
91 1.1 cgd db_look_char = c;
92 1.1 cgd }
93 1.1 cgd
94 1.1 cgd int db_look_token = 0;
95 1.1 cgd
96 1.1 cgd void
97 1.1 cgd db_unread_token(t)
98 1.1 cgd int t;
99 1.1 cgd {
100 1.1 cgd db_look_token = t;
101 1.1 cgd }
102 1.1 cgd
103 1.1 cgd int
104 1.1 cgd db_read_token()
105 1.1 cgd {
106 1.1 cgd int t;
107 1.1 cgd
108 1.1 cgd if (db_look_token) {
109 1.1 cgd t = db_look_token;
110 1.1 cgd db_look_token = 0;
111 1.1 cgd }
112 1.1 cgd else
113 1.1 cgd t = db_lex();
114 1.1 cgd return (t);
115 1.1 cgd }
116 1.1 cgd
117 1.1 cgd int db_radix = 16;
118 1.12 jhawk
119 1.12 jhawk /*
120 1.12 jhawk * Convert the number to a string in the current radix.
121 1.12 jhawk * This replaces the non-standard %n printf() format.
122 1.12 jhawk */
123 1.12 jhawk
124 1.12 jhawk char *
125 1.12 jhawk db_num_to_str(val)
126 1.12 jhawk db_expr_t val;
127 1.12 jhawk {
128 1.12 jhawk /*
129 1.12 jhawk * 2 chars for "0x", 1 for a sign ("-")
130 1.12 jhawk * up to 21 chars for a 64-bit number:
131 1.12 jhawk * % echo 2^64 | bc | wc -c
132 1.12 jhawk * 21
133 1.12 jhawk * and 1 char for a terminal NUL
134 1.12 jhawk * 2+1+21+1 => 25
135 1.12 jhawk */
136 1.12 jhawk static char buf[25];
137 1.12 jhawk char format[] = "%#10lZ";
138 1.12 jhawk
139 1.12 jhawk if (db_radix == 16)
140 1.12 jhawk format[5] = 'x'; /* convert to %lx */
141 1.12 jhawk else if (db_radix == 8)
142 1.12 jhawk format[5] = 'o'; /* convert to %lo */
143 1.12 jhawk else
144 1.12 jhawk format[5] = 'u'; /* convert to %lu */
145 1.12 jhawk
146 1.12 jhawk snprintf(buf, sizeof(buf), format, val);
147 1.12 jhawk return buf;
148 1.12 jhawk }
149 1.1 cgd
150 1.1 cgd void
151 1.1 cgd db_flush_lex()
152 1.1 cgd {
153 1.1 cgd db_flush_line();
154 1.1 cgd db_look_char = 0;
155 1.1 cgd db_look_token = 0;
156 1.1 cgd }
157 1.1 cgd
158 1.1 cgd int
159 1.1 cgd db_lex()
160 1.1 cgd {
161 1.1 cgd int c;
162 1.1 cgd
163 1.1 cgd c = db_read_char();
164 1.1 cgd while (c <= ' ' || c > '~') {
165 1.1 cgd if (c == '\n' || c == -1)
166 1.1 cgd return (tEOL);
167 1.1 cgd c = db_read_char();
168 1.1 cgd }
169 1.1 cgd
170 1.1 cgd if (c >= '0' && c <= '9') {
171 1.1 cgd /* number */
172 1.9 cgd db_expr_t r, digit = 0;
173 1.1 cgd
174 1.1 cgd if (c > '0')
175 1.1 cgd r = db_radix;
176 1.1 cgd else {
177 1.1 cgd c = db_read_char();
178 1.1 cgd if (c == 'O' || c == 'o')
179 1.1 cgd r = 8;
180 1.1 cgd else if (c == 'T' || c == 't')
181 1.1 cgd r = 10;
182 1.1 cgd else if (c == 'X' || c == 'x')
183 1.1 cgd r = 16;
184 1.1 cgd else {
185 1.1 cgd r = db_radix;
186 1.1 cgd db_unread_char(c);
187 1.1 cgd }
188 1.1 cgd c = db_read_char();
189 1.1 cgd }
190 1.1 cgd db_tok_number = 0;
191 1.1 cgd for (;;) {
192 1.1 cgd if (c >= '0' && c <= ((r == 8) ? '7' : '9'))
193 1.1 cgd digit = c - '0';
194 1.1 cgd else if (r == 16 && ((c >= 'A' && c <= 'F') ||
195 1.1 cgd (c >= 'a' && c <= 'f'))) {
196 1.1 cgd if (c >= 'a')
197 1.1 cgd digit = c - 'a' + 10;
198 1.1 cgd else if (c >= 'A')
199 1.1 cgd digit = c - 'A' + 10;
200 1.1 cgd }
201 1.1 cgd else
202 1.1 cgd break;
203 1.1 cgd db_tok_number = db_tok_number * r + digit;
204 1.1 cgd c = db_read_char();
205 1.1 cgd }
206 1.1 cgd if ((c >= '0' && c <= '9') ||
207 1.1 cgd (c >= 'A' && c <= 'Z') ||
208 1.1 cgd (c >= 'a' && c <= 'z') ||
209 1.1 cgd (c == '_'))
210 1.1 cgd {
211 1.1 cgd db_error("Bad character in number\n");
212 1.7 mycroft /*NOTREACHED*/
213 1.1 cgd }
214 1.1 cgd db_unread_char(c);
215 1.1 cgd return (tNUMBER);
216 1.1 cgd }
217 1.1 cgd if ((c >= 'A' && c <= 'Z') ||
218 1.1 cgd (c >= 'a' && c <= 'z') ||
219 1.1 cgd c == '_' || c == '\\')
220 1.1 cgd {
221 1.1 cgd /* string */
222 1.1 cgd char *cp;
223 1.1 cgd
224 1.1 cgd cp = db_tok_string;
225 1.1 cgd if (c == '\\') {
226 1.1 cgd c = db_read_char();
227 1.7 mycroft if (c == '\n' || c == -1) {
228 1.1 cgd db_error("Bad escape\n");
229 1.7 mycroft /*NOTREACHED*/
230 1.7 mycroft }
231 1.1 cgd }
232 1.1 cgd *cp++ = c;
233 1.1 cgd while (1) {
234 1.1 cgd c = db_read_char();
235 1.1 cgd if ((c >= 'A' && c <= 'Z') ||
236 1.1 cgd (c >= 'a' && c <= 'z') ||
237 1.1 cgd (c >= '0' && c <= '9') ||
238 1.1 cgd c == '_' || c == '\\' || c == ':')
239 1.1 cgd {
240 1.1 cgd if (c == '\\') {
241 1.1 cgd c = db_read_char();
242 1.7 mycroft if (c == '\n' || c == -1) {
243 1.1 cgd db_error("Bad escape\n");
244 1.7 mycroft /*NOTREACHED*/
245 1.7 mycroft }
246 1.1 cgd }
247 1.1 cgd *cp++ = c;
248 1.1 cgd if (cp == db_tok_string+sizeof(db_tok_string)) {
249 1.1 cgd db_error("String too long\n");
250 1.7 mycroft /*NOTREACHED*/
251 1.1 cgd }
252 1.1 cgd continue;
253 1.1 cgd }
254 1.1 cgd else {
255 1.1 cgd *cp = '\0';
256 1.1 cgd break;
257 1.1 cgd }
258 1.1 cgd }
259 1.1 cgd db_unread_char(c);
260 1.1 cgd return (tIDENT);
261 1.1 cgd }
262 1.1 cgd
263 1.1 cgd switch (c) {
264 1.1 cgd case '+':
265 1.1 cgd return (tPLUS);
266 1.1 cgd case '-':
267 1.1 cgd return (tMINUS);
268 1.1 cgd case '.':
269 1.1 cgd c = db_read_char();
270 1.1 cgd if (c == '.')
271 1.1 cgd return (tDOTDOT);
272 1.1 cgd db_unread_char(c);
273 1.1 cgd return (tDOT);
274 1.1 cgd case '*':
275 1.1 cgd return (tSTAR);
276 1.1 cgd case '/':
277 1.1 cgd return (tSLASH);
278 1.1 cgd case '=':
279 1.1 cgd return (tEQ);
280 1.1 cgd case '%':
281 1.1 cgd return (tPCT);
282 1.1 cgd case '#':
283 1.1 cgd return (tHASH);
284 1.1 cgd case '(':
285 1.1 cgd return (tLPAREN);
286 1.1 cgd case ')':
287 1.1 cgd return (tRPAREN);
288 1.1 cgd case ',':
289 1.1 cgd return (tCOMMA);
290 1.1 cgd case '"':
291 1.1 cgd return (tDITTO);
292 1.1 cgd case '$':
293 1.1 cgd return (tDOLLAR);
294 1.1 cgd case '!':
295 1.1 cgd return (tEXCL);
296 1.1 cgd case '<':
297 1.1 cgd c = db_read_char();
298 1.1 cgd if (c == '<')
299 1.1 cgd return (tSHIFT_L);
300 1.1 cgd db_unread_char(c);
301 1.1 cgd break;
302 1.1 cgd case '>':
303 1.1 cgd c = db_read_char();
304 1.1 cgd if (c == '>')
305 1.1 cgd return (tSHIFT_R);
306 1.1 cgd db_unread_char(c);
307 1.1 cgd break;
308 1.1 cgd case -1:
309 1.1 cgd return (tEOF);
310 1.1 cgd }
311 1.1 cgd db_printf("Bad character\n");
312 1.1 cgd db_flush_lex();
313 1.1 cgd return (tEOF);
314 1.1 cgd }
315