db_xxx.c revision 1.19 1 1.19 pk /* $NetBSD: db_xxx.c,v 1.19 2003/01/23 12:41:33 pk Exp $ */
2 1.1 gwr
3 1.1 gwr /*
4 1.1 gwr * Copyright (c) 1982, 1986, 1989, 1991, 1993
5 1.1 gwr * The Regents of the University of California. All rights reserved.
6 1.1 gwr *
7 1.1 gwr * Redistribution and use in source and binary forms, with or without
8 1.1 gwr * modification, are permitted provided that the following conditions
9 1.1 gwr * are met:
10 1.1 gwr * 1. Redistributions of source code must retain the above copyright
11 1.1 gwr * notice, this list of conditions and the following disclaimer.
12 1.1 gwr * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 gwr * notice, this list of conditions and the following disclaimer in the
14 1.1 gwr * documentation and/or other materials provided with the distribution.
15 1.1 gwr * 3. All advertising materials mentioning features or use of this software
16 1.1 gwr * must display the following acknowledgement:
17 1.1 gwr * This product includes software developed by the University of
18 1.1 gwr * California, Berkeley and its contributors.
19 1.1 gwr * 4. Neither the name of the University nor the names of its contributors
20 1.1 gwr * may be used to endorse or promote products derived from this software
21 1.1 gwr * without specific prior written permission.
22 1.1 gwr *
23 1.1 gwr * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 gwr * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 gwr * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 gwr * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 gwr * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 gwr * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 gwr * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 gwr * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 gwr * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 gwr * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 gwr * SUCH DAMAGE.
34 1.1 gwr *
35 1.1 gwr * from: kern_proc.c 8.4 (Berkeley) 1/4/94
36 1.1 gwr */
37 1.1 gwr
38 1.1 gwr /*
39 1.1 gwr * Miscellaneous DDB functions that are intimate (xxx) with various
40 1.1 gwr * data structures and functions used by the kernel (proc, callout).
41 1.1 gwr */
42 1.15 lukem
43 1.15 lukem #include <sys/cdefs.h>
44 1.19 pk __KERNEL_RCSID(0, "$NetBSD: db_xxx.c,v 1.19 2003/01/23 12:41:33 pk Exp $");
45 1.1 gwr
46 1.1 gwr #include <sys/param.h>
47 1.1 gwr #include <sys/systm.h>
48 1.1 gwr #include <sys/kernel.h>
49 1.1 gwr #include <sys/proc.h>
50 1.12 atatat #include <sys/msgbuf.h>
51 1.1 gwr
52 1.1 gwr #include <sys/callout.h>
53 1.1 gwr #include <sys/signalvar.h>
54 1.3 ross #include <sys/resourcevar.h>
55 1.1 gwr
56 1.1 gwr #include <machine/db_machdep.h>
57 1.1 gwr
58 1.1 gwr #include <ddb/db_access.h>
59 1.1 gwr #include <ddb/db_command.h>
60 1.1 gwr #include <ddb/db_interface.h>
61 1.1 gwr #include <ddb/db_lex.h>
62 1.1 gwr #include <ddb/db_output.h>
63 1.1 gwr #include <ddb/db_sym.h>
64 1.1 gwr #include <ddb/db_extern.h>
65 1.1 gwr
66 1.1 gwr void
67 1.16 simonb db_kill_proc(db_expr_t addr, int haddr, db_expr_t count, char *modif)
68 1.1 gwr {
69 1.1 gwr struct proc *p;
70 1.1 gwr db_expr_t pid, sig;
71 1.1 gwr int t;
72 1.1 gwr
73 1.1 gwr /* What pid? */
74 1.1 gwr if (!db_expression(&pid)) {
75 1.1 gwr db_error("pid?\n");
76 1.16 simonb /*NOTREACHED*/
77 1.1 gwr }
78 1.1 gwr /* What sig? */
79 1.1 gwr t = db_read_token();
80 1.1 gwr if (t == tCOMMA) {
81 1.1 gwr if (!db_expression(&sig)) {
82 1.1 gwr db_error("sig?\n");
83 1.1 gwr /*NOTREACHED*/
84 1.1 gwr }
85 1.1 gwr } else {
86 1.1 gwr db_unread_token(t);
87 1.1 gwr sig = 15;
88 1.1 gwr }
89 1.1 gwr if (db_read_token() != tEOL) {
90 1.16 simonb db_error("?\n");
91 1.16 simonb /*NOTREACHED*/
92 1.1 gwr }
93 1.1 gwr
94 1.1 gwr p = pfind((pid_t)pid);
95 1.1 gwr if (p == NULL) {
96 1.1 gwr db_error("no such proc\n");
97 1.16 simonb /*NOTREACHED*/
98 1.1 gwr }
99 1.1 gwr psignal(p, (int)sig);
100 1.1 gwr }
101 1.1 gwr
102 1.1 gwr void
103 1.16 simonb db_show_all_procs(db_expr_t addr, int haddr, db_expr_t count, char *modif)
104 1.1 gwr {
105 1.3 ross int i;
106 1.18 thorpej
107 1.2 chuck char *mode;
108 1.18 thorpej struct proc *p, *pp, *cp;
109 1.18 thorpej struct lwp *l, *cl;
110 1.14 chs struct timeval tv[2];
111 1.5 thorpej const struct proclist_desc *pd;
112 1.16 simonb
113 1.2 chuck if (modif[0] == 0)
114 1.2 chuck modif[0] = 'n'; /* default == normal mode */
115 1.2 chuck
116 1.18 thorpej mode = strchr("mawln", modif[0]);
117 1.2 chuck if (mode == NULL || *mode == 'm') {
118 1.2 chuck db_printf("usage: show all procs [/a] [/n] [/w]\n");
119 1.2 chuck db_printf("\t/a == show process address info\n");
120 1.18 thorpej db_printf("\t/l == show LWP info\n");
121 1.2 chuck db_printf("\t/n == show normal process info [default]\n");
122 1.2 chuck db_printf("\t/w == show process wait/emul info\n");
123 1.2 chuck return;
124 1.2 chuck }
125 1.16 simonb
126 1.2 chuck switch (*mode) {
127 1.2 chuck case 'a':
128 1.3 ross db_printf(" PID %10s %18s %18s %18s\n",
129 1.2 chuck "COMMAND", "STRUCT PROC *", "UAREA *", "VMSPACE/VM_MAP");
130 1.2 chuck break;
131 1.18 thorpej case 'l':
132 1.18 thorpej db_printf(" PID %4s S %7s %18s %18s %-12s\n",
133 1.18 thorpej "LID", "FLAGS", "STRUCT LWP *", "UAREA *", "WAIT");
134 1.18 thorpej break;
135 1.2 chuck case 'n':
136 1.18 thorpej db_printf(" PID %8s %8s %10s S %7s %4s %16s %7s\n",
137 1.18 thorpej "PPID", "PGRP", "UID", "FLAGS", "LWPS", "COMMAND", "WAIT");
138 1.2 chuck break;
139 1.2 chuck case 'w':
140 1.3 ross db_printf(" PID %10s %8s %4s %5s %5s %-12s%s\n",
141 1.3 ross "COMMAND", "EMUL", "PRI", "UTIME", "STIME",
142 1.3 ross "WAIT-MSG", "WAIT-CHANNEL");
143 1.2 chuck break;
144 1.2 chuck }
145 1.2 chuck
146 1.6 thorpej /* XXX LOCKING XXX */
147 1.5 thorpej pd = proclists;
148 1.18 thorpej cp = curproc;
149 1.18 thorpej cl = curlwp;
150 1.14 chs for (pd = proclists; pd->pd_list != NULL; pd++) {
151 1.14 chs LIST_FOREACH(p, pd->pd_list, p_list) {
152 1.14 chs pp = p->p_pptr;
153 1.14 chs if (p->p_stat == 0) {
154 1.14 chs continue;
155 1.14 chs }
156 1.18 thorpej l = LIST_FIRST(&p->p_lwps);
157 1.18 thorpej db_printf("%c%-10d", " >"[cp == p], p->p_pid);
158 1.2 chuck
159 1.2 chuck switch (*mode) {
160 1.2 chuck
161 1.2 chuck case 'a':
162 1.2 chuck db_printf("%10.10s %18p %18p %18p\n",
163 1.19 pk p->p_comm, p,
164 1.19 pk l != NULL ? l->l_addr : 0,
165 1.19 pk p->p_vmspace);
166 1.18 thorpej break;
167 1.18 thorpej case 'l':
168 1.19 pk while (l != NULL) {
169 1.18 thorpej db_printf("%c%4d %d %#7x %18p %18p %s\n",
170 1.18 thorpej " >"[cl == l], l->l_lid,
171 1.18 thorpej l->l_stat, l->l_flag, l,
172 1.18 thorpej l->l_addr,
173 1.18 thorpej (l->l_wchan && l->l_wmesg) ?
174 1.18 thorpej l->l_wmesg : "");
175 1.18 thorpej
176 1.18 thorpej l = LIST_NEXT(l, l_sibling);
177 1.18 thorpej if (l)
178 1.18 thorpej db_printf("%11s","");
179 1.19 pk }
180 1.2 chuck break;
181 1.2 chuck case 'n':
182 1.18 thorpej db_printf("%8d %8d %10d %d %#7x %4d %16s %7.7s\n",
183 1.2 chuck pp ? pp->p_pid : -1, p->p_pgrp->pg_id,
184 1.2 chuck p->p_cred->p_ruid, p->p_stat, p->p_flag,
185 1.18 thorpej p->p_nlwps, p->p_comm,
186 1.19 pk (p->p_nlwps != 1) ? "*" : (
187 1.18 thorpej (l->l_wchan && l->l_wmesg) ?
188 1.18 thorpej l->l_wmesg : ""));
189 1.2 chuck break;
190 1.2 chuck
191 1.2 chuck case 'w':
192 1.3 ross db_printf("%10s %8s %4d", p->p_comm,
193 1.19 pk p->p_emul->e_name,
194 1.19 pk (l != NULL) ? l->l_priority : -1);
195 1.14 chs calcru(p, &tv[0], &tv[1], NULL);
196 1.14 chs for (i = 0; i < 2; ++i) {
197 1.8 kleink db_printf("%4ld.%1ld",
198 1.8 kleink (long)tv[i].tv_sec,
199 1.8 kleink (long)tv[i].tv_usec/100000);
200 1.3 ross }
201 1.19 pk if (p->p_nlwps == 1) {
202 1.18 thorpej if (l->l_wchan && l->l_wmesg) {
203 1.18 thorpej db_printf(" %-12s", l->l_wmesg);
204 1.17 scw db_printsym(
205 1.18 thorpej (db_expr_t)(intptr_t)l->l_wchan,
206 1.9 jhawk DB_STGY_XTRN, db_printf);
207 1.18 thorpej } } else {
208 1.18 thorpej db_printf(" * ");
209 1.3 ross }
210 1.3 ross db_printf("\n");
211 1.2 chuck break;
212 1.2 chuck
213 1.1 gwr }
214 1.1 gwr }
215 1.1 gwr }
216 1.1 gwr }
217 1.1 gwr
218 1.1 gwr void
219 1.16 simonb db_show_callout(db_expr_t addr, int haddr, db_expr_t count, char *modif)
220 1.1 gwr {
221 1.13 thorpej uint64_t hint;
222 1.10 eeh int i;
223 1.1 gwr
224 1.11 thorpej for (i = 0; i < callwheelsize; i++) {
225 1.10 eeh struct callout_queue *bucket = &callwheel[i];
226 1.13 thorpej struct callout *c = TAILQ_FIRST(&bucket->cq_q);
227 1.10 eeh
228 1.13 thorpej if (c) {
229 1.13 thorpej db_printf("bucket %d (hint %llx):\n", i,
230 1.13 thorpej (long long) bucket->cq_hint);
231 1.13 thorpej hint = UQUAD_MAX;
232 1.13 thorpej while (c) {
233 1.13 thorpej if (c->c_time < hint)
234 1.13 thorpej hint = c->c_time;
235 1.13 thorpej db_printf("%p: time %llx arg %p flags %x "
236 1.13 thorpej "func %p: ", c, (long long) c->c_time,
237 1.13 thorpej c->c_arg, c->c_flags, c->c_func);
238 1.13 thorpej db_printsym((u_long)c->c_func, DB_STGY_PROC,
239 1.13 thorpej db_printf);
240 1.13 thorpej db_printf("\n");
241 1.13 thorpej c = TAILQ_NEXT(c, c_link);
242 1.13 thorpej }
243 1.13 thorpej if (bucket->cq_hint < hint)
244 1.13 thorpej printf("** HINT IS STALE\n");
245 1.10 eeh }
246 1.10 eeh }
247 1.12 atatat }
248 1.12 atatat
249 1.12 atatat void
250 1.16 simonb db_dmesg(db_expr_t addr, int haddr, db_expr_t count, char *modif)
251 1.12 atatat {
252 1.12 atatat struct kern_msgbuf *mbp;
253 1.12 atatat int ch, newl, skip, i;
254 1.12 atatat char *p, *bufdata;
255 1.12 atatat
256 1.12 atatat mbp = msgbufp;
257 1.12 atatat bufdata = &mbp->msg_bufc[0];
258 1.12 atatat
259 1.12 atatat for (newl = skip = i = 0, p = bufdata + mbp->msg_bufx;
260 1.12 atatat i < mbp->msg_bufs; i++, p++) {
261 1.12 atatat if (p == bufdata + mbp->msg_bufs)
262 1.12 atatat p = bufdata;
263 1.12 atatat ch = *p;
264 1.12 atatat /* Skip "\n<.*>" syslog sequences. */
265 1.12 atatat if (skip) {
266 1.12 atatat if (ch == '>')
267 1.12 atatat newl = skip = 0;
268 1.12 atatat continue;
269 1.12 atatat }
270 1.12 atatat if (newl && ch == '<') {
271 1.12 atatat skip = 1;
272 1.12 atatat continue;
273 1.12 atatat }
274 1.12 atatat if (ch == '\0')
275 1.12 atatat continue;
276 1.12 atatat newl = ch == '\n';
277 1.12 atatat db_printf("%c", ch);
278 1.12 atatat }
279 1.12 atatat if (!newl)
280 1.12 atatat db_printf("\n");
281 1.1 gwr }
282