db_expr.c revision 1.11 1 1.11 mycroft /* $NetBSD: db_expr.c,v 1.11 2000/07/09 01:52:17 mycroft 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.9 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.3 mycroft #include <sys/param.h>
33 1.3 mycroft #include <sys/proc.h>
34 1.3 mycroft
35 1.1 cgd #include <machine/db_machdep.h>
36 1.3 mycroft
37 1.1 cgd #include <ddb/db_lex.h>
38 1.1 cgd #include <ddb/db_access.h>
39 1.1 cgd #include <ddb/db_command.h>
40 1.5 christos #include <ddb/db_sym.h>
41 1.5 christos #include <ddb/db_extern.h>
42 1.5 christos #include <ddb/db_variables.h>
43 1.1 cgd
44 1.1 cgd boolean_t
45 1.1 cgd db_term(valuep)
46 1.1 cgd db_expr_t *valuep;
47 1.1 cgd {
48 1.1 cgd int t;
49 1.1 cgd
50 1.1 cgd t = db_read_token();
51 1.1 cgd if (t == tIDENT) {
52 1.1 cgd if (!db_value_of_name(db_tok_string, valuep)) {
53 1.10 eeh extern int db_radix;
54 1.10 eeh db_expr_t v = 0;
55 1.10 eeh int i, c, byte;
56 1.10 eeh
57 1.10 eeh /* See if we can make a number out of all of it */
58 1.11 mycroft for (i = 0; (c = db_tok_string[i]) != '\0'; i++) {
59 1.10 eeh byte = 0;
60 1.10 eeh if (c >= '0' && c <= '9')
61 1.10 eeh byte = c - '0';
62 1.10 eeh else if (db_radix == 16 && c >= 'a' && c <= 'f')
63 1.10 eeh byte = c - 'a' + 10;
64 1.10 eeh else if (db_radix == 16 && c >= 'A' && c <= 'F')
65 1.10 eeh byte = c - 'A' + 10;
66 1.10 eeh else
67 1.10 eeh db_error("Symbol not found\n");
68 1.10 eeh /*NOTREACHED*/
69 1.10 eeh v = v * db_radix + byte;
70 1.10 eeh }
71 1.10 eeh *valuep = (db_expr_t)v;
72 1.1 cgd }
73 1.1 cgd return (TRUE);
74 1.1 cgd }
75 1.1 cgd if (t == tNUMBER) {
76 1.1 cgd *valuep = (db_expr_t)db_tok_number;
77 1.1 cgd return (TRUE);
78 1.1 cgd }
79 1.1 cgd if (t == tDOT) {
80 1.1 cgd *valuep = (db_expr_t)db_dot;
81 1.1 cgd return (TRUE);
82 1.1 cgd }
83 1.1 cgd if (t == tDOTDOT) {
84 1.1 cgd *valuep = (db_expr_t)db_prev;
85 1.1 cgd return (TRUE);
86 1.1 cgd }
87 1.1 cgd if (t == tPLUS) {
88 1.1 cgd *valuep = (db_expr_t) db_next;
89 1.1 cgd return (TRUE);
90 1.1 cgd }
91 1.1 cgd if (t == tDITTO) {
92 1.1 cgd *valuep = (db_expr_t)db_last_addr;
93 1.1 cgd return (TRUE);
94 1.1 cgd }
95 1.1 cgd if (t == tDOLLAR) {
96 1.1 cgd if (!db_get_variable(valuep))
97 1.1 cgd return (FALSE);
98 1.1 cgd return (TRUE);
99 1.1 cgd }
100 1.1 cgd if (t == tLPAREN) {
101 1.1 cgd if (!db_expression(valuep)) {
102 1.1 cgd db_error("Syntax error\n");
103 1.1 cgd /*NOTREACHED*/
104 1.1 cgd }
105 1.1 cgd t = db_read_token();
106 1.1 cgd if (t != tRPAREN) {
107 1.1 cgd db_error("Syntax error\n");
108 1.1 cgd /*NOTREACHED*/
109 1.1 cgd }
110 1.1 cgd return (TRUE);
111 1.1 cgd }
112 1.1 cgd db_unread_token(t);
113 1.1 cgd return (FALSE);
114 1.1 cgd }
115 1.1 cgd
116 1.1 cgd boolean_t
117 1.1 cgd db_unary(valuep)
118 1.1 cgd db_expr_t *valuep;
119 1.1 cgd {
120 1.1 cgd int t;
121 1.1 cgd
122 1.1 cgd t = db_read_token();
123 1.1 cgd if (t == tMINUS) {
124 1.1 cgd if (!db_unary(valuep)) {
125 1.1 cgd db_error("Syntax error\n");
126 1.1 cgd /*NOTREACHED*/
127 1.1 cgd }
128 1.1 cgd *valuep = -*valuep;
129 1.1 cgd return (TRUE);
130 1.1 cgd }
131 1.1 cgd if (t == tSTAR) {
132 1.1 cgd /* indirection */
133 1.1 cgd if (!db_unary(valuep)) {
134 1.1 cgd db_error("Syntax error\n");
135 1.1 cgd /*NOTREACHED*/
136 1.1 cgd }
137 1.7 thorpej *valuep = db_get_value((db_addr_t)*valuep, sizeof(db_expr_t),
138 1.7 thorpej FALSE);
139 1.1 cgd return (TRUE);
140 1.1 cgd }
141 1.1 cgd db_unread_token(t);
142 1.1 cgd return (db_term(valuep));
143 1.1 cgd }
144 1.1 cgd
145 1.1 cgd boolean_t
146 1.1 cgd db_mult_expr(valuep)
147 1.1 cgd db_expr_t *valuep;
148 1.1 cgd {
149 1.1 cgd db_expr_t lhs, rhs;
150 1.1 cgd int t;
151 1.1 cgd
152 1.1 cgd if (!db_unary(&lhs))
153 1.1 cgd return (FALSE);
154 1.1 cgd
155 1.1 cgd t = db_read_token();
156 1.1 cgd while (t == tSTAR || t == tSLASH || t == tPCT || t == tHASH) {
157 1.1 cgd if (!db_term(&rhs)) {
158 1.1 cgd db_error("Syntax error\n");
159 1.1 cgd /*NOTREACHED*/
160 1.1 cgd }
161 1.1 cgd if (t == tSTAR)
162 1.1 cgd lhs *= rhs;
163 1.1 cgd else {
164 1.1 cgd if (rhs == 0) {
165 1.1 cgd db_error("Divide by 0\n");
166 1.1 cgd /*NOTREACHED*/
167 1.1 cgd }
168 1.1 cgd if (t == tSLASH)
169 1.1 cgd lhs /= rhs;
170 1.1 cgd else if (t == tPCT)
171 1.1 cgd lhs %= rhs;
172 1.1 cgd else
173 1.1 cgd lhs = ((lhs+rhs-1)/rhs)*rhs;
174 1.1 cgd }
175 1.1 cgd t = db_read_token();
176 1.1 cgd }
177 1.1 cgd db_unread_token(t);
178 1.1 cgd *valuep = lhs;
179 1.1 cgd return (TRUE);
180 1.1 cgd }
181 1.1 cgd
182 1.1 cgd boolean_t
183 1.1 cgd db_add_expr(valuep)
184 1.1 cgd db_expr_t *valuep;
185 1.1 cgd {
186 1.1 cgd db_expr_t lhs, rhs;
187 1.1 cgd int t;
188 1.1 cgd
189 1.1 cgd if (!db_mult_expr(&lhs))
190 1.1 cgd return (FALSE);
191 1.1 cgd
192 1.1 cgd t = db_read_token();
193 1.1 cgd while (t == tPLUS || t == tMINUS) {
194 1.1 cgd if (!db_mult_expr(&rhs)) {
195 1.1 cgd db_error("Syntax error\n");
196 1.1 cgd /*NOTREACHED*/
197 1.1 cgd }
198 1.1 cgd if (t == tPLUS)
199 1.1 cgd lhs += rhs;
200 1.1 cgd else
201 1.1 cgd lhs -= rhs;
202 1.1 cgd t = db_read_token();
203 1.1 cgd }
204 1.1 cgd db_unread_token(t);
205 1.1 cgd *valuep = lhs;
206 1.1 cgd return (TRUE);
207 1.1 cgd }
208 1.1 cgd
209 1.1 cgd boolean_t
210 1.1 cgd db_shift_expr(valuep)
211 1.1 cgd db_expr_t *valuep;
212 1.1 cgd {
213 1.1 cgd db_expr_t lhs, rhs;
214 1.1 cgd int t;
215 1.1 cgd
216 1.1 cgd if (!db_add_expr(&lhs))
217 1.1 cgd return (FALSE);
218 1.1 cgd
219 1.1 cgd t = db_read_token();
220 1.1 cgd while (t == tSHIFT_L || t == tSHIFT_R) {
221 1.1 cgd if (!db_add_expr(&rhs)) {
222 1.1 cgd db_error("Syntax error\n");
223 1.1 cgd /*NOTREACHED*/
224 1.1 cgd }
225 1.1 cgd if (rhs < 0) {
226 1.1 cgd db_error("Negative shift amount\n");
227 1.1 cgd /*NOTREACHED*/
228 1.1 cgd }
229 1.1 cgd if (t == tSHIFT_L)
230 1.1 cgd lhs <<= rhs;
231 1.1 cgd else {
232 1.1 cgd /* Shift right is unsigned */
233 1.6 cgd lhs = (unsigned long) lhs >> rhs;
234 1.1 cgd }
235 1.1 cgd t = db_read_token();
236 1.1 cgd }
237 1.1 cgd db_unread_token(t);
238 1.1 cgd *valuep = lhs;
239 1.1 cgd return (TRUE);
240 1.1 cgd }
241 1.1 cgd
242 1.1 cgd int
243 1.1 cgd db_expression(valuep)
244 1.1 cgd db_expr_t *valuep;
245 1.1 cgd {
246 1.1 cgd return (db_shift_expr(valuep));
247 1.1 cgd }
248