db_xxx.c revision 1.42.4.1 1 /* $NetBSD: db_xxx.c,v 1.42.4.1 2007/05/27 00:15:12 ad Exp $ */
2
3 /*
4 * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 *
31 * from: kern_proc.c 8.4 (Berkeley) 1/4/94
32 */
33
34 /*
35 * Miscellaneous DDB functions that are intimate (xxx) with various
36 * data structures and functions used by the kernel (proc, callout).
37 */
38
39 #include "opt_kgdb.h"
40
41 #include <sys/cdefs.h>
42 __KERNEL_RCSID(0, "$NetBSD: db_xxx.c,v 1.42.4.1 2007/05/27 00:15:12 ad Exp $");
43
44 #include <sys/param.h>
45 #include <sys/systm.h>
46 #include <sys/kernel.h>
47 #include <sys/proc.h>
48 #include <sys/msgbuf.h>
49
50 #include <sys/callout.h>
51 #include <sys/signalvar.h>
52 #include <sys/resourcevar.h>
53 #include <sys/pool.h>
54 #include <sys/kauth.h>
55
56 #include <machine/db_machdep.h>
57
58 #include <ddb/db_access.h>
59 #include <ddb/db_command.h>
60 #include <ddb/db_interface.h>
61 #include <ddb/db_lex.h>
62 #include <ddb/db_output.h>
63 #include <ddb/db_sym.h>
64 #include <ddb/db_extern.h>
65 #ifdef KGDB
66 #include <sys/kgdb.h>
67 #endif
68
69 void
70 db_kill_proc(db_expr_t addr, bool haddr,
71 db_expr_t count, const char *modif)
72 {
73 struct proc *p;
74 db_expr_t pid, sig;
75 int t;
76
77 /* What pid? */
78 if (!db_expression(&pid)) {
79 db_error("pid?\n");
80 /*NOTREACHED*/
81 }
82 /* What sig? */
83 t = db_read_token();
84 if (t == tCOMMA) {
85 if (!db_expression(&sig)) {
86 db_error("sig?\n");
87 /*NOTREACHED*/
88 }
89 } else {
90 db_unread_token(t);
91 sig = 15;
92 }
93 if (db_read_token() != tEOL) {
94 db_error("?\n");
95 /*NOTREACHED*/
96 }
97
98 p = pfind((pid_t)pid);
99 if (p == NULL) {
100 db_error("no such proc\n");
101 /*NOTREACHED*/
102 }
103 psignal(p, (int)sig);
104 }
105
106 #ifdef KGDB
107 void
108 db_kgdb_cmd(db_expr_t addr, bool haddr,
109 db_expr_t count, const char *modif)
110 {
111 kgdb_active++;
112 kgdb_trap(db_trap_type, DDB_REGS);
113 kgdb_active--;
114 }
115 #endif
116
117 void
118 db_show_all_procs(db_expr_t addr, bool haddr,
119 db_expr_t count, const char *modif)
120 {
121 int i;
122
123 const char *mode;
124 struct proc *p, *pp, *cp;
125 struct lwp *l, *cl;
126 struct timeval tv[2];
127 const struct proclist_desc *pd;
128 char nbuf[MAXCOMLEN + 1];
129
130 if (modif[0] == 0)
131 mode = "n"; /* default == normal mode */
132 else
133 mode = strchr("mawln", modif[0]);
134
135 if (mode == NULL || *mode == 'm') {
136 db_printf("usage: show all procs [/a] [/l] [/n] [/w]\n");
137 db_printf("\t/a == show process address info\n");
138 db_printf("\t/l == show LWP info\n");
139 db_printf("\t/n == show normal process info [default]\n");
140 db_printf("\t/w == show process wait/emul info\n");
141 return;
142 }
143
144 switch (*mode) {
145 case 'a':
146 db_printf(" PID %10s %18s %18s %18s\n",
147 "COMMAND", "STRUCT PROC *", "UAREA *", "VMSPACE/VM_MAP");
148 break;
149 case 'l':
150 db_printf(" PID %4s S %9s %18s %18s %-8s\n",
151 "LID", "FLAGS", "STRUCT LWP *", "NAME", "WAIT");
152 break;
153 case 'n':
154 db_printf(" PID %8s %8s %10s S %7s %4s %16s %7s\n",
155 "PPID", "PGRP", "UID", "FLAGS", "LWPS", "COMMAND", "WAIT");
156 break;
157 case 'w':
158 db_printf(" PID %10s %8s %4s %5s %5s %-12s%s\n",
159 "COMMAND", "EMUL", "PRI", "UTIME", "STIME",
160 "WAIT-MSG", "WAIT-CHANNEL");
161 break;
162 }
163
164 /* XXX LOCKING XXX */
165 pd = proclists;
166 cp = curproc;
167 cl = curlwp;
168 for (pd = proclists; pd->pd_list != NULL; pd++) {
169 LIST_FOREACH(p, pd->pd_list, p_list) {
170 pp = p->p_pptr;
171 if (p->p_stat == 0) {
172 continue;
173 }
174 l = LIST_FIRST(&p->p_lwps);
175 db_printf("%c%-10d", (cp == p ? '>' : ' '), p->p_pid);
176
177 switch (*mode) {
178
179 case 'a':
180 db_printf("%10.10s %18lx %18lx %18lx\n",
181 p->p_comm, (long)p,
182 (long)(l != NULL ? l->l_addr : 0),
183 (long)p->p_vmspace);
184 break;
185 case 'l':
186 while (l != NULL) {
187 if (l->l_name != NULL) {
188 snprintf(nbuf, sizeof(nbuf),
189 "%s", l->l_name);
190 } else
191 snprintf(nbuf, sizeof(nbuf),
192 "%s", p->p_comm);
193 db_printf("%c%4d %d %9x %18lx %18s %-8s\n",
194 (cl == l ? '>' : ' '), l->l_lid,
195 l->l_stat, l->l_flag, (long)l, nbuf,
196 (l->l_wchan && l->l_wmesg) ?
197 l->l_wmesg : "");
198
199 l = LIST_NEXT(l, l_sibling);
200 if (l)
201 db_printf("%11s","");
202 }
203 break;
204 case 'n':
205 db_printf("%8d %8d %10d %d %#7x %4d %16s %7.7s\n",
206 pp ? pp->p_pid : -1, p->p_pgrp->pg_id,
207 kauth_cred_getuid(p->p_cred), p->p_stat, p->p_flag,
208 p->p_nlwps, p->p_comm,
209 (p->p_nlwps != 1) ? "*" : (
210 (l->l_wchan && l->l_wmesg) ?
211 l->l_wmesg : ""));
212 break;
213
214 case 'w':
215 db_printf("%10s %8s %4d", p->p_comm,
216 p->p_emul->e_name,
217 (l != NULL) ? l->l_priority : -1);
218 calcru(p, &tv[0], &tv[1], NULL, NULL);
219 for (i = 0; i < 2; ++i) {
220 db_printf("%4ld.%1ld",
221 (long)tv[i].tv_sec,
222 (long)tv[i].tv_usec/100000);
223 }
224 if (p->p_nlwps == 1) {
225 if (l->l_wchan && l->l_wmesg) {
226 db_printf(" %-12s", l->l_wmesg);
227 db_printsym(
228 (db_expr_t)(intptr_t)l->l_wchan,
229 DB_STGY_XTRN, db_printf);
230 } } else {
231 db_printf(" * ");
232 }
233 db_printf("\n");
234 break;
235
236 }
237 }
238 }
239 }
240
241 void
242 db_show_all_pools(db_expr_t addr, bool haddr,
243 db_expr_t count, const char *modif)
244 {
245
246 pool_printall(modif, db_printf);
247 }
248
249 void
250 db_dmesg(db_expr_t addr, bool haddr, db_expr_t count,
251 const char *modif)
252 {
253 struct kern_msgbuf *mbp;
254 db_expr_t print;
255 int ch, newl, skip, i;
256 char *p, *bufdata;
257
258 if (!msgbufenabled || msgbufp->msg_magic != MSG_MAGIC) {
259 db_printf("message buffer not available\n");
260 return;
261 }
262
263 mbp = msgbufp;
264 bufdata = &mbp->msg_bufc[0];
265
266 if (haddr && addr < mbp->msg_bufs)
267 print = addr;
268 else
269 print = mbp->msg_bufs;
270
271 for (newl = skip = i = 0, p = bufdata + mbp->msg_bufx;
272 i < mbp->msg_bufs; i++, p++) {
273 if (p == bufdata + mbp->msg_bufs)
274 p = bufdata;
275 if (i < mbp->msg_bufs - print)
276 continue;
277 ch = *p;
278 /* Skip "\n<.*>" syslog sequences. */
279 if (skip) {
280 if (ch == '>')
281 newl = skip = 0;
282 continue;
283 }
284 if (newl && ch == '<') {
285 skip = 1;
286 continue;
287 }
288 if (ch == '\0')
289 continue;
290 newl = ch == '\n';
291 db_printf("%c", ch);
292 }
293 if (!newl)
294 db_printf("\n");
295 }
296
297 #ifdef __HAVE_BIGENDIAN_BITOPS
298 #define RQMASK(n) (0x80000000 >> (n))
299 #else
300 #define RQMASK(n) (0x00000001 << (n))
301 #endif
302
303 void
304 db_show_sched_qs(db_expr_t addr, bool haddr,
305 db_expr_t count, const char *modif)
306 {
307 struct prochd *ph;
308 struct lwp *l;
309 int i, first;
310
311 for (i = 0; i < RUNQUE_NQS; i++)
312 {
313 first = 1;
314 ph = &sched_qs[i];
315 for (l = ph->ph_link; l != (void *)ph; l = l->l_forw) {
316 if (first) {
317 db_printf("%c%d",
318 (sched_whichqs & RQMASK(i))
319 ? ' ' : '!', i);
320 first = 0;
321 }
322 db_printf("\t%d.%d (%s) pri=%d usrpri=%d\n",
323 l->l_proc->p_pid,
324 l->l_lid, l->l_proc->p_comm,
325 (int)l->l_priority, (int)l->l_usrpri);
326 }
327 }
328 }
329