db_output.c revision 1.4 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.4 brezak * db_output.c,v 1.3 1993/05/20 03:39:21 cgd Exp
36 1.3 cgd *
37 1.1 cgd * HISTORY
38 1.4 brezak * db_output.c,v
39 1.4 brezak * Revision 1.3 1993/05/20 03:39:21 cgd
40 1.4 brezak * add explicit rcs id
41 1.4 brezak *
42 1.3 cgd * Revision 1.2 1993/03/21 18:08:08 cgd
43 1.3 cgd * after 0.2.2 "stable" patches applied
44 1.3 cgd *
45 1.2 cgd * Revision 1.1.1.1 93/03/21 09:46:26 cgd
46 1.2 cgd * initial import of 386bsd-0.1 sources
47 1.2 cgd *
48 1.1 cgd * Revision 1.1 1992/03/25 21:45:18 pace
49 1.1 cgd * Initial revision
50 1.1 cgd *
51 1.1 cgd * Revision 2.3 91/02/05 17:06:45 mrt
52 1.1 cgd * Changed to new Mach copyright
53 1.1 cgd * [91/01/31 16:18:41 mrt]
54 1.1 cgd *
55 1.1 cgd * Revision 2.2 90/08/27 21:51:25 dbg
56 1.1 cgd * Put extra features of db_doprnt in _doprnt.
57 1.1 cgd * [90/08/20 dbg]
58 1.1 cgd * Reduce lint.
59 1.1 cgd * [90/08/07 dbg]
60 1.1 cgd * Created.
61 1.1 cgd * [90/07/25 dbg]
62 1.1 cgd *
63 1.1 cgd */
64 1.1 cgd /*
65 1.1 cgd * Author: David B. Golub, Carnegie Mellon University
66 1.1 cgd * Date: 7/90
67 1.1 cgd */
68 1.1 cgd
69 1.1 cgd /*
70 1.1 cgd * Printf and character output for debugger.
71 1.1 cgd */
72 1.1 cgd
73 1.1 cgd #include "param.h"
74 1.1 cgd #include <machine/stdarg.h>
75 1.1 cgd
76 1.1 cgd /*
77 1.1 cgd * Character output - tracks position in line.
78 1.1 cgd * To do this correctly, we should know how wide
79 1.1 cgd * the output device is - then we could zero
80 1.1 cgd * the line position when the output device wraps
81 1.1 cgd * around to the start of the next line.
82 1.1 cgd *
83 1.1 cgd * Instead, we count the number of spaces printed
84 1.1 cgd * since the last printing character so that we
85 1.1 cgd * don't print trailing spaces. This avoids most
86 1.1 cgd * of the wraparounds.
87 1.1 cgd */
88 1.4 brezak
89 1.4 brezak #ifndef DB_MAX_LINE
90 1.4 brezak #define DB_MAX_LINE 24 /* maximum line */
91 1.4 brezak #define DB_MAX_WIDTH 80 /* maximum width */
92 1.4 brezak #endif DB_MAX_LINE
93 1.4 brezak
94 1.4 brezak #define DB_MIN_MAX_WIDTH 20 /* minimum max width */
95 1.4 brezak #define DB_MIN_MAX_LINE 3 /* minimum max line */
96 1.4 brezak #define CTRL(c) ((c) & 0xff)
97 1.4 brezak
98 1.1 cgd int db_output_position = 0; /* output column */
99 1.4 brezak int db_output_line = 0; /* output line number */
100 1.1 cgd int db_last_non_space = 0; /* last non-space character */
101 1.1 cgd int db_tab_stop_width = 8; /* how wide are tab stops? */
102 1.1 cgd #define NEXT_TAB(i) \
103 1.1 cgd ((((i) + db_tab_stop_width) / db_tab_stop_width) * db_tab_stop_width)
104 1.4 brezak int db_max_line = DB_MAX_LINE; /* output max lines */
105 1.4 brezak int db_max_width = DB_MAX_WIDTH; /* output line width */
106 1.1 cgd
107 1.1 cgd extern void db_check_interrupt();
108 1.1 cgd
109 1.1 cgd /*
110 1.1 cgd * Force pending whitespace.
111 1.1 cgd */
112 1.1 cgd void
113 1.1 cgd db_force_whitespace()
114 1.1 cgd {
115 1.1 cgd register int last_print, next_tab;
116 1.1 cgd
117 1.1 cgd last_print = db_last_non_space;
118 1.1 cgd while (last_print < db_output_position) {
119 1.1 cgd next_tab = NEXT_TAB(last_print);
120 1.1 cgd if (next_tab <= db_output_position) {
121 1.2 cgd while (last_print < next_tab) { /* DON'T send a tab!!! */
122 1.2 cgd cnputc(' ');
123 1.2 cgd last_print++;
124 1.2 cgd }
125 1.1 cgd }
126 1.1 cgd else {
127 1.1 cgd cnputc(' ');
128 1.1 cgd last_print++;
129 1.1 cgd }
130 1.1 cgd }
131 1.1 cgd db_last_non_space = db_output_position;
132 1.1 cgd }
133 1.1 cgd
134 1.4 brezak static void
135 1.4 brezak db_more()
136 1.4 brezak {
137 1.4 brezak register char *p;
138 1.4 brezak int quit_output = 0;
139 1.4 brezak
140 1.4 brezak for (p = "--db_more--"; *p; p++)
141 1.4 brezak cnputc(*p);
142 1.4 brezak switch(cngetc()) {
143 1.4 brezak case ' ':
144 1.4 brezak db_output_line = 0;
145 1.4 brezak break;
146 1.4 brezak case 'q':
147 1.4 brezak case CTRL('c'):
148 1.4 brezak db_output_line = 0;
149 1.4 brezak quit_output = 1;
150 1.4 brezak break;
151 1.4 brezak default:
152 1.4 brezak db_output_line--;
153 1.4 brezak break;
154 1.4 brezak }
155 1.4 brezak p = "\b\b\b\b\b\b\b\b\b\b\b \b\b\b\b\b\b\b\b\b\b\b";
156 1.4 brezak while (*p)
157 1.4 brezak cnputc(*p++);
158 1.4 brezak if (quit_output) {
159 1.4 brezak db_error(0);
160 1.4 brezak /* NOTREACHED */
161 1.4 brezak }
162 1.4 brezak }
163 1.4 brezak
164 1.1 cgd /*
165 1.1 cgd * Output character. Buffer whitespace.
166 1.1 cgd */
167 1.1 cgd db_putchar(c)
168 1.1 cgd int c; /* character to output */
169 1.1 cgd {
170 1.4 brezak if (db_max_line >= DB_MIN_MAX_LINE && db_output_line >= db_max_line-1)
171 1.4 brezak db_more();
172 1.1 cgd if (c > ' ' && c <= '~') {
173 1.1 cgd /*
174 1.1 cgd * Printing character.
175 1.1 cgd * If we have spaces to print, print them first.
176 1.1 cgd * Use tabs if possible.
177 1.1 cgd */
178 1.1 cgd db_force_whitespace();
179 1.1 cgd cnputc(c);
180 1.1 cgd db_output_position++;
181 1.4 brezak if (db_max_width >= DB_MIN_MAX_WIDTH
182 1.4 brezak && db_output_position >= db_max_width-1) {
183 1.4 brezak /* auto new line */
184 1.4 brezak cnputc('\n');
185 1.4 brezak db_output_position = 0;
186 1.4 brezak db_last_non_space = 0;
187 1.4 brezak db_output_line++;
188 1.4 brezak }
189 1.1 cgd db_last_non_space = db_output_position;
190 1.1 cgd }
191 1.1 cgd else if (c == '\n') {
192 1.1 cgd /* Return */
193 1.1 cgd cnputc(c);
194 1.1 cgd db_output_position = 0;
195 1.1 cgd db_last_non_space = 0;
196 1.4 brezak db_output_line++;
197 1.1 cgd db_check_interrupt();
198 1.1 cgd }
199 1.1 cgd else if (c == '\t') {
200 1.1 cgd /* assume tabs every 8 positions */
201 1.1 cgd db_output_position = NEXT_TAB(db_output_position);
202 1.1 cgd }
203 1.1 cgd else if (c == ' ') {
204 1.1 cgd /* space */
205 1.1 cgd db_output_position++;
206 1.1 cgd }
207 1.1 cgd else if (c == '\007') {
208 1.1 cgd /* bell */
209 1.1 cgd cnputc(c);
210 1.1 cgd }
211 1.1 cgd /* other characters are assumed non-printing */
212 1.1 cgd }
213 1.1 cgd
214 1.1 cgd /*
215 1.1 cgd * Return output position
216 1.1 cgd */
217 1.1 cgd int
218 1.1 cgd db_print_position()
219 1.1 cgd {
220 1.1 cgd return (db_output_position);
221 1.1 cgd }
222 1.1 cgd
223 1.1 cgd /*
224 1.1 cgd * Printing
225 1.1 cgd */
226 1.1 cgd extern int db_radix;
227 1.1 cgd
228 1.1 cgd /*VARARGS1*/
229 1.1 cgd db_printf(char *fmt, ...)
230 1.1 cgd {
231 1.1 cgd va_list listp;
232 1.1 cgd va_start(listp, fmt);
233 1.1 cgd db_printf_guts (fmt, listp);
234 1.1 cgd va_end(listp);
235 1.1 cgd }
236 1.1 cgd
237 1.1 cgd /* alternate name */
238 1.1 cgd
239 1.1 cgd /*VARARGS1*/
240 1.1 cgd kdbprintf(char *fmt, ...)
241 1.1 cgd {
242 1.1 cgd va_list listp;
243 1.1 cgd va_start(listp, fmt);
244 1.1 cgd db_printf_guts (fmt, listp);
245 1.1 cgd va_end(listp);
246 1.4 brezak }
247 1.4 brezak
248 1.4 brezak /*
249 1.4 brezak * End line if too long.
250 1.4 brezak */
251 1.4 brezak void
252 1.4 brezak db_end_line()
253 1.4 brezak {
254 1.4 brezak if (db_output_position >= db_max_width)
255 1.4 brezak db_printf("\n");
256 1.1 cgd }
257 1.1 cgd
258 1.1 cgd /*
259 1.1 cgd * Put a number (base <= 16) in a buffer in reverse order; return an
260 1.1 cgd * optional length and a pointer to the NULL terminated (preceded?)
261 1.1 cgd * buffer.
262 1.1 cgd */
263 1.1 cgd static char *
264 1.1 cgd db_ksprintn(ul, base, lenp)
265 1.1 cgd register u_long ul;
266 1.1 cgd register int base, *lenp;
267 1.1 cgd { /* A long in base 8, plus NULL. */
268 1.1 cgd static char buf[sizeof(long) * NBBY / 3 + 2];
269 1.1 cgd register char *p;
270 1.1 cgd
271 1.1 cgd p = buf;
272 1.1 cgd do {
273 1.1 cgd *++p = "0123456789abcdef"[ul % base];
274 1.1 cgd } while (ul /= base);
275 1.1 cgd if (lenp)
276 1.1 cgd *lenp = p - buf;
277 1.1 cgd return (p);
278 1.1 cgd }
279 1.1 cgd
280 1.1 cgd db_printf_guts(fmt, ap)
281 1.1 cgd register const char *fmt;
282 1.1 cgd va_list ap;
283 1.1 cgd {
284 1.1 cgd register char *p;
285 1.1 cgd register int ch, n;
286 1.1 cgd u_long ul;
287 1.1 cgd int base, lflag, tmp, width;
288 1.1 cgd char padc;
289 1.1 cgd int ladjust;
290 1.1 cgd int sharpflag;
291 1.1 cgd int neg;
292 1.1 cgd
293 1.1 cgd for (;;) {
294 1.1 cgd padc = ' ';
295 1.1 cgd width = 0;
296 1.1 cgd while ((ch = *(u_char *)fmt++) != '%') {
297 1.1 cgd if (ch == '\0')
298 1.1 cgd return;
299 1.1 cgd db_putchar(ch);
300 1.1 cgd }
301 1.1 cgd lflag = 0;
302 1.1 cgd ladjust = 0;
303 1.1 cgd sharpflag = 0;
304 1.1 cgd neg = 0;
305 1.1 cgd reswitch: switch (ch = *(u_char *)fmt++) {
306 1.1 cgd case '0':
307 1.1 cgd padc = '0';
308 1.1 cgd goto reswitch;
309 1.1 cgd case '1': case '2': case '3': case '4':
310 1.1 cgd case '5': case '6': case '7': case '8': case '9':
311 1.1 cgd for (width = 0;; ++fmt) {
312 1.1 cgd width = width * 10 + ch - '0';
313 1.1 cgd ch = *fmt;
314 1.1 cgd if (ch < '0' || ch > '9')
315 1.1 cgd break;
316 1.1 cgd }
317 1.1 cgd goto reswitch;
318 1.1 cgd case 'l':
319 1.1 cgd lflag = 1;
320 1.1 cgd goto reswitch;
321 1.1 cgd case '-':
322 1.1 cgd ladjust = 1;
323 1.1 cgd goto reswitch;
324 1.1 cgd case '#':
325 1.1 cgd sharpflag = 1;
326 1.1 cgd goto reswitch;
327 1.1 cgd case 'b':
328 1.1 cgd ul = va_arg(ap, int);
329 1.1 cgd p = va_arg(ap, char *);
330 1.1 cgd for (p = db_ksprintn(ul, *p++, NULL); ch = *p--;)
331 1.1 cgd db_putchar(ch);
332 1.1 cgd
333 1.1 cgd if (!ul)
334 1.1 cgd break;
335 1.1 cgd
336 1.1 cgd for (tmp = 0; n = *p++;) {
337 1.1 cgd if (ul & (1 << (n - 1))) {
338 1.1 cgd db_putchar(tmp ? ',' : '<');
339 1.1 cgd for (; (n = *p) > ' '; ++p)
340 1.1 cgd db_putchar(n);
341 1.1 cgd tmp = 1;
342 1.1 cgd } else
343 1.1 cgd for (; *p > ' '; ++p);
344 1.1 cgd }
345 1.1 cgd if (tmp)
346 1.1 cgd db_putchar('>');
347 1.1 cgd break;
348 1.1 cgd case '*':
349 1.1 cgd width = va_arg (ap, int);
350 1.1 cgd if (width < 0) {
351 1.1 cgd ladjust = !ladjust;
352 1.1 cgd width = -width;
353 1.1 cgd }
354 1.1 cgd goto reswitch;
355 1.1 cgd case 'c':
356 1.1 cgd db_putchar(va_arg(ap, int));
357 1.1 cgd break;
358 1.1 cgd case 's':
359 1.1 cgd p = va_arg(ap, char *);
360 1.1 cgd width -= strlen (p);
361 1.1 cgd if (!ladjust && width > 0)
362 1.1 cgd while (width--)
363 1.1 cgd db_putchar (padc);
364 1.1 cgd while (ch = *p++)
365 1.1 cgd db_putchar(ch);
366 1.1 cgd if (ladjust && width > 0)
367 1.1 cgd while (width--)
368 1.1 cgd db_putchar (padc);
369 1.1 cgd break;
370 1.1 cgd case 'r':
371 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
372 1.1 cgd if ((long)ul < 0) {
373 1.1 cgd neg = 1;
374 1.1 cgd ul = -(long)ul;
375 1.1 cgd }
376 1.1 cgd base = db_radix;
377 1.1 cgd if (base < 8 || base > 16)
378 1.1 cgd base = 10;
379 1.1 cgd goto number;
380 1.1 cgd case 'n':
381 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
382 1.1 cgd base = db_radix;
383 1.1 cgd if (base < 8 || base > 16)
384 1.1 cgd base = 10;
385 1.1 cgd goto number;
386 1.1 cgd case 'd':
387 1.1 cgd ul = lflag ? va_arg(ap, long) : va_arg(ap, int);
388 1.1 cgd if ((long)ul < 0) {
389 1.1 cgd neg = 1;
390 1.1 cgd ul = -(long)ul;
391 1.1 cgd }
392 1.1 cgd base = 10;
393 1.1 cgd goto number;
394 1.1 cgd case 'o':
395 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
396 1.1 cgd base = 8;
397 1.1 cgd goto number;
398 1.1 cgd case 'u':
399 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
400 1.1 cgd base = 10;
401 1.1 cgd goto number;
402 1.1 cgd case 'z':
403 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
404 1.1 cgd if ((long)ul < 0) {
405 1.1 cgd neg = 1;
406 1.1 cgd ul = -(long)ul;
407 1.1 cgd }
408 1.1 cgd base = 16;
409 1.1 cgd goto number;
410 1.1 cgd case 'x':
411 1.1 cgd ul = lflag ? va_arg(ap, u_long) : va_arg(ap, u_int);
412 1.1 cgd base = 16;
413 1.1 cgd number: p = (char *)db_ksprintn(ul, base, &tmp);
414 1.1 cgd if (sharpflag && ul != 0) {
415 1.1 cgd if (base == 8)
416 1.1 cgd tmp++;
417 1.1 cgd else if (base == 16)
418 1.1 cgd tmp += 2;
419 1.1 cgd }
420 1.1 cgd if (neg)
421 1.1 cgd tmp++;
422 1.1 cgd
423 1.1 cgd if (!ladjust && width && (width -= tmp) > 0)
424 1.1 cgd while (width--)
425 1.1 cgd db_putchar(padc);
426 1.1 cgd if (neg)
427 1.1 cgd db_putchar ('-');
428 1.1 cgd if (sharpflag && ul != 0) {
429 1.1 cgd if (base == 8) {
430 1.1 cgd db_putchar ('0');
431 1.1 cgd } else if (base == 16) {
432 1.1 cgd db_putchar ('0');
433 1.1 cgd db_putchar ('x');
434 1.1 cgd }
435 1.1 cgd }
436 1.1 cgd if (ladjust && width && (width -= tmp) > 0)
437 1.1 cgd while (width--)
438 1.1 cgd db_putchar(padc);
439 1.1 cgd
440 1.1 cgd while (ch = *p--)
441 1.1 cgd db_putchar(ch);
442 1.1 cgd break;
443 1.1 cgd default:
444 1.1 cgd db_putchar('%');
445 1.1 cgd if (lflag)
446 1.1 cgd db_putchar('l');
447 1.1 cgd /* FALLTHROUGH */
448 1.1 cgd case '%':
449 1.1 cgd db_putchar(ch);
450 1.1 cgd }
451 1.1 cgd }
452 1.1 cgd }
453 1.1 cgd
454