db_output.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Mach Operating System
3 1.1 cgd * Copyright (c) 1991,1990 Carnegie Mellon University
4 1.1 cgd * All Rights Reserved.
5 1.1 cgd *
6 1.1 cgd * Permission to use, copy, modify and distribute this software and its
7 1.1 cgd * documentation is hereby granted, provided that both the copyright
8 1.1 cgd * notice and this permission notice appear in all copies of the
9 1.1 cgd * software, derivative works or modified versions, and any portions
10 1.1 cgd * thereof, and that both notices appear in supporting documentation.
11 1.1 cgd *
12 1.1 cgd * CARNEGIE MELLON ALLOWS FREE USE OF THIS SOFTWARE IN ITS
13 1.1 cgd * CONDITION. CARNEGIE MELLON DISCLAIMS ANY LIABILITY OF ANY KIND FOR
14 1.1 cgd * ANY DAMAGES WHATSOEVER RESULTING FROM THE USE OF THIS SOFTWARE.
15 1.1 cgd *
16 1.1 cgd * Carnegie Mellon requests users of this software to return to
17 1.1 cgd *
18 1.1 cgd * Software Distribution Coordinator or Software.Distribution (at) CS.CMU.EDU
19 1.1 cgd * School of Computer Science
20 1.1 cgd * Carnegie Mellon University
21 1.1 cgd * Pittsburgh PA 15213-3890
22 1.1 cgd *
23 1.1 cgd * any improvements or extensions that they make and grant Carnegie the
24 1.1 cgd * rights to redistribute these changes.
25 1.2 cgd *
26 1.2 cgd * PATCHES MAGIC LEVEL PATCH THAT GOT US HERE
27 1.2 cgd * -------------------- ----- ----------------------
28 1.2 cgd * CURRENT PATCH LEVEL: 4 00083
29 1.2 cgd * -------------------- ----- ----------------------
30 1.2 cgd *
31 1.2 cgd * 14 Mar 93 Chris G. Demetriou Fixed so that tab is not output,
32 1.2 cgd * use spaces instead.
33 1.1 cgd */
34 1.1 cgd /*
35 1.1 cgd * HISTORY
36 1.2 cgd * $Log: db_output.c,v $
37 1.2 cgd * Revision 1.2 1993/03/21 18:04:42 cgd
38 1.2 cgd * after 0.2.2 "stable" patches applied
39 1.2 cgd *
40 1.1 cgd * Revision 1.1.1.1 93/03/21 09:46:26 cgd
41 1.1 cgd * initial import of 386bsd-0.1 sources
42 1.1 cgd *
43 1.1 cgd * Revision 1.1 1992/03/25 21:45:18 pace
44 1.1 cgd * Initial revision
45 1.1 cgd *
46 1.1 cgd * Revision 2.3 91/02/05 17:06:45 mrt
47 1.1 cgd * Changed to new Mach copyright
48 1.1 cgd * [91/01/31 16:18:41 mrt]
49 1.1 cgd *
50 1.1 cgd * Revision 2.2 90/08/27 21:51:25 dbg
51 1.1 cgd * Put extra features of db_doprnt in _doprnt.
52 1.1 cgd * [90/08/20 dbg]
53 1.1 cgd * Reduce lint.
54 1.1 cgd * [90/08/07 dbg]
55 1.1 cgd * Created.
56 1.1 cgd * [90/07/25 dbg]
57 1.1 cgd *
58 1.1 cgd */
59 1.1 cgd /*
60 1.1 cgd * Author: David B. Golub, Carnegie Mellon University
61 1.1 cgd * Date: 7/90
62 1.1 cgd */
63 1.1 cgd
64 1.1 cgd /*
65 1.1 cgd * Printf and character output for debugger.
66 1.1 cgd */
67 1.1 cgd
68 1.1 cgd #include "param.h"
69 1.1 cgd #include <machine/stdarg.h>
70 1.1 cgd
71 1.1 cgd /*
72 1.1 cgd * Character output - tracks position in line.
73 1.1 cgd * To do this correctly, we should know how wide
74 1.1 cgd * the output device is - then we could zero
75 1.1 cgd * the line position when the output device wraps
76 1.1 cgd * around to the start of the next line.
77 1.1 cgd *
78 1.1 cgd * Instead, we count the number of spaces printed
79 1.1 cgd * since the last printing character so that we
80 1.1 cgd * don't print trailing spaces. This avoids most
81 1.1 cgd * of the wraparounds.
82 1.1 cgd */
83 1.1 cgd int db_output_position = 0; /* output column */
84 1.1 cgd int db_last_non_space = 0; /* last non-space character */
85 1.1 cgd int db_tab_stop_width = 8; /* how wide are tab stops? */
86 1.1 cgd #define NEXT_TAB(i) \
87 1.1 cgd ((((i) + db_tab_stop_width) / db_tab_stop_width) * db_tab_stop_width)
88 1.1 cgd int db_max_width = 80; /* output line width */
89 1.1 cgd
90 1.1 cgd extern void db_check_interrupt();
91 1.1 cgd
92 1.1 cgd /*
93 1.1 cgd * Force pending whitespace.
94 1.1 cgd */
95 1.1 cgd void
96 1.1 cgd db_force_whitespace()
97 1.1 cgd {
98 1.1 cgd register int last_print, next_tab;
99 1.1 cgd
100 1.1 cgd last_print = db_last_non_space;
101 1.2 cgd while (last_print < db_output_position) {
102 1.2 cgd next_tab = NEXT_TAB(last_print);
103 1.2 cgd if (next_tab <= db_output_position) {
104 1.2 cgd while (last_print < next_tab) { /* DON'T send a tab!!! */
105 1.1 cgd cnputc(' ');
106 1.1 cgd last_print++;
107 1.1 cgd }
108 1.1 cgd }
109 1.1 cgd else {
110 1.1 cgd cnputc(' ');
111 1.1 cgd last_print++;
112 1.1 cgd }
113 1.1 cgd }
114 1.1 cgd db_last_non_space = db_output_position;
115 1.1 cgd }
116 1.1 cgd
117 1.1 cgd /*
118 1.1 cgd * Output character. Buffer whitespace.
119 1.1 cgd */
120 1.1 cgd db_putchar(c)
121 1.1 cgd int c; /* character to output */
122 1.1 cgd {
123 1.1 cgd if (c > ' ' && c <= '~') {
124 1.1 cgd /*
125 1.1 cgd * Printing character.
126 1.1 cgd * If we have spaces to print, print them first.
127 1.1 cgd * Use tabs if possible.
128 1.1 cgd */
129 1.1 cgd db_force_whitespace();
130 1.1 cgd cnputc(c);
131 1.1 cgd db_output_position++;
132 1.1 cgd db_last_non_space = db_output_position;
133 1.1 cgd }
134 1.1 cgd else if (c == '\n') {
135 1.1 cgd /* Return */
136 1.1 cgd cnputc(c);
137 1.1 cgd db_output_position = 0;
138 1.1 cgd db_last_non_space = 0;
139 1.1 cgd db_check_interrupt();
140 1.1 cgd }
141 1.1 cgd else if (c == '\t') {
142 1.1 cgd /* assume tabs every 8 positions */
143 1.1 cgd db_output_position = NEXT_TAB(db_output_position);
144 1.1 cgd }
145 1.1 cgd else if (c == ' ') {
146 1.1 cgd /* space */
147 1.1 cgd db_output_position++;
148 1.1 cgd }
149 1.1 cgd else if (c == '\007') {
150 1.1 cgd /* bell */
151 1.1 cgd cnputc(c);
152 1.1 cgd }
153 1.1 cgd /* other characters are assumed non-printing */
154 1.1 cgd }
155 1.1 cgd
156 1.1 cgd /*
157 1.1 cgd * Return output position
158 1.1 cgd */
159 1.1 cgd int
160 1.1 cgd db_print_position()
161 1.1 cgd {
162 1.1 cgd return (db_output_position);
163 1.1 cgd }
164 1.1 cgd
165 1.1 cgd /*
166 1.1 cgd * End line if too long.
167 1.1 cgd */
168 1.1 cgd void
169 1.1 cgd db_end_line()
170 1.1 cgd {
171 1.1 cgd if (db_output_position >= db_max_width)
172 1.1 cgd db_printf("\n");
173 1.1 cgd }
174 1.1 cgd
175 1.1 cgd /*
176 1.1 cgd * Printing
177 1.1 cgd */
178 1.1 cgd extern int db_radix;
179 1.1 cgd
180 1.1 cgd /*VARARGS1*/
181 1.1 cgd db_printf(char *fmt, ...)
182 1.1 cgd {
183 1.1 cgd va_list listp;
184 1.1 cgd va_start(listp, fmt);
185 1.1 cgd db_printf_guts (fmt, listp);
186 1.1 cgd va_end(listp);
187 1.1 cgd }
188 1.1 cgd
189 1.1 cgd /* alternate name */
190 1.1 cgd
191 1.1 cgd /*VARARGS1*/
192 1.1 cgd kdbprintf(char *fmt, ...)
193 1.1 cgd {
194 1.1 cgd va_list listp;
195 1.1 cgd va_start(listp, fmt);
196 1.1 cgd db_printf_guts (fmt, listp);
197 1.1 cgd va_end(listp);
198 1.1 cgd }
199 1.1 cgd
200 1.1 cgd /*
201 1.1 cgd * Put a number (base <= 16) in a buffer in reverse order; return an
202 1.1 cgd * optional length and a pointer to the NULL terminated (preceded?)
203 1.1 cgd * buffer.
204 1.1 cgd */
205 1.1 cgd static char *
206 1.1 cgd db_ksprintn(ul, base, lenp)
207 1.1 cgd register u_long ul;
208 1.1 cgd register int base, *lenp;
209 1.1 cgd { /* A long in base 8, plus NULL. */
210 1.1 cgd static char buf[sizeof(long) * NBBY / 3 + 2];
211 1.1 cgd register char *p;
212 1.1 cgd
213 1.1 cgd p = buf;
214 1.1 cgd do {
215 1.1 cgd *++p = "0123456789abcdef"[ul % base];
216 1.1 cgd } while (ul /= base);
217 1.1 cgd if (lenp)
218 1.1 cgd *lenp = p - buf;
219 1.1 cgd return (p);
220 1.1 cgd }
221 1.1 cgd
222 1.1 cgd db_printf_guts(fmt, ap)
223 1.1 cgd register const char *fmt;
224 1.1 cgd va_list ap;
225 1.1 cgd {
226 1.1 cgd register char *p;
227 1.1 cgd register int ch, n;
228 1.1 cgd u_long ul;
229 1.1 cgd int base, lflag, tmp, width;
230 1.1 cgd char padc;
231 1.1 cgd int ladjust;
232 1.1 cgd int sharpflag;
233 1.1 cgd int neg;
234 1.1 cgd
235 1.1 cgd for (;;) {
236 1.1 cgd padc = ' ';
237 1.1 cgd width = 0;
238 1.1 cgd while ((ch = *(u_char *)fmt++) != '%') {
239 1.1 cgd if (ch == '\0')
240 1.1 cgd return;
241 1.1 cgd db_putchar(ch);
242 1.1 cgd }
243 1.1 cgd lflag = 0;
244 1.1 cgd ladjust = 0;
245 1.1 cgd sharpflag = 0;
246 1.1 cgd neg = 0;
247 1.1 cgd reswitch: switch (ch = *(u_char *)fmt++) {
248 1.1 cgd case '0':
249 1.1 cgd padc = '0';
250 1.1 cgd goto reswitch;
251 1.1 cgd case '1': case '2': case '3': case '4':
252 1.1 cgd case '5': case '6': case '7': case '8': case '9':
253 1.1 cgd for (width = 0;; ++fmt) {
254 1.1 cgd width = width * 10 + ch - '0';
255 1.1 cgd ch = *fmt;
256 1.1 cgd if (ch < '0' || ch > '9')
257 1.1 cgd break;
258 1.1 cgd }
259 1.1 cgd goto reswitch;
260 1.1 cgd case 'l':
261 1.1 cgd lflag = 1;
262 1.1 cgd goto reswitch;
263 1.1 cgd case '-':
264 1.1 cgd ladjust = 1;
265 1.1 cgd goto reswitch;
266 1.1 cgd case '#':
267 1.1 cgd sharpflag = 1;
268 1.1 cgd goto reswitch;
269 1.1 cgd case 'b':
270 1.1 cgd ul = va_arg(ap, int);
271 1.1 cgd p = va_arg(ap, char *);
272 1.1 cgd for (p = db_ksprintn(ul, *p++, NULL); ch = *p--;)
273 1.1 cgd db_putchar(ch);
274 1.1 cgd
275 1.1 cgd if (!ul)
276 1.1 cgd break;
277 1.1 cgd
278 1.1 cgd for (tmp = 0; n = *p++;) {
279 1.1 cgd if (ul & (1 << (n - 1))) {
280 1.1 cgd db_putchar(tmp ? ',' : '<');
281 1.1 cgd for (; (n = *p) > ' '; ++p)
282 1.1 cgd db_putchar(n);
283 1.1 cgd tmp = 1;
284 1.1 cgd } else
285 1.1 cgd for (; *p > ' '; ++p);
286 1.1 cgd }
287 1.1 cgd if (tmp)
288 1.1 cgd db_putchar('>');
289 1.1 cgd break;
290 1.1 cgd case '*':
291 1.1 cgd width = va_arg (ap, int);
292 1.1 cgd if (width < 0) {
293 1.1 cgd ladjust = !ladjust;
294 1.1 cgd width = -width;
295 1.1 cgd }
296 1.1 cgd goto reswitch;
297 1.1 cgd case 'c':
298 1.1 cgd db_putchar(va_arg(ap, int));
299 1.1 cgd break;
300 1.1 cgd case 's':
301 1.1 cgd p = va_arg(ap, char *);
302 1.1 cgd width -= strlen (p);
303 1.1 cgd if (!ladjust && width > 0)
304 1.1 cgd while (width--)
305 1.1 cgd db_putchar (padc);
306 1.1 cgd while (ch = *p++)
307 1.1 cgd db_putchar(ch);
308 1.1 cgd if (ladjust && width > 0)
309 1.1 cgd while (width--)
310 1.1 cgd db_putchar (padc);
311 1.1 cgd break;
312 1.1 cgd case 'r':
313 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
314 1.1 cgd if ((long)ul < 0) {
315 1.1 cgd neg = 1;
316 1.1 cgd ul = -(long)ul;
317 1.1 cgd }
318 1.1 cgd base = db_radix;
319 1.1 cgd if (base < 8 || base > 16)
320 1.1 cgd base = 10;
321 1.1 cgd goto number;
322 1.1 cgd case 'n':
323 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
324 1.1 cgd base = db_radix;
325 1.1 cgd if (base < 8 || base > 16)
326 1.1 cgd base = 10;
327 1.1 cgd goto number;
328 1.1 cgd case 'd':
329 1.1 cgd ul = lflag ? va_arg(ap, long) : va_arg(ap, int);
330 1.1 cgd if ((long)ul < 0) {
331 1.1 cgd neg = 1;
332 1.1 cgd ul = -(long)ul;
333 1.1 cgd }
334 1.1 cgd base = 10;
335 1.1 cgd goto number;
336 1.1 cgd case 'o':
337 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
338 1.1 cgd base = 8;
339 1.1 cgd goto number;
340 1.1 cgd case 'u':
341 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
342 1.1 cgd base = 10;
343 1.1 cgd goto number;
344 1.1 cgd case 'z':
345 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
346 1.1 cgd if ((long)ul < 0) {
347 1.1 cgd neg = 1;
348 1.1 cgd ul = -(long)ul;
349 1.1 cgd }
350 1.1 cgd base = 16;
351 1.1 cgd goto number;
352 1.1 cgd case 'x':
353 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
354 1.1 cgd base = 16;
355 1.1 cgd number: p = (char *)db_ksprintn(ul, base, &tmp);
356 1.1 cgd if (sharpflag && ul != 0) {
357 1.1 cgd if (base == 8)
358 1.1 cgd tmp++;
359 1.1 cgd else if (base == 16)
360 1.1 cgd tmp += 2;
361 1.1 cgd }
362 1.1 cgd if (neg)
363 1.1 cgd tmp++;
364 1.1 cgd
365 1.1 cgd if (!ladjust && width && (width -= tmp) > 0)
366 1.1 cgd while (width--)
367 1.1 cgd db_putchar(padc);
368 1.1 cgd if (neg)
369 1.1 cgd db_putchar ('-');
370 1.1 cgd if (sharpflag && ul != 0) {
371 1.1 cgd if (base == 8) {
372 1.1 cgd db_putchar ('0');
373 1.1 cgd } else if (base == 16) {
374 1.1 cgd db_putchar ('0');
375 1.1 cgd db_putchar ('x');
376 1.1 cgd }
377 1.1 cgd }
378 1.1 cgd if (ladjust && width && (width -= tmp) > 0)
379 1.1 cgd while (width--)
380 1.1 cgd db_putchar(padc);
381 1.1 cgd
382 1.1 cgd while (ch = *p--)
383 1.1 cgd db_putchar(ch);
384 1.1 cgd break;
385 1.1 cgd default:
386 1.1 cgd db_putchar('%');
387 1.1 cgd if (lflag)
388 1.1 cgd db_putchar('l');
389 1.1 cgd /* FALLTHROUGH */
390 1.1 cgd case '%':
391 1.1 cgd db_putchar(ch);
392 1.1 cgd }
393 }
394 }
395
396