db_xxx.c revision 1.11.2.1 1 1.11.2.1 nathanw /* $NetBSD: db_xxx.c,v 1.11.2.1 2001/03/05 22:49:32 nathanw 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.1 gwr
43 1.1 gwr #include <sys/param.h>
44 1.1 gwr #include <sys/systm.h>
45 1.1 gwr #include <sys/kernel.h>
46 1.11.2.1 nathanw #include <sys/lwp.h>
47 1.1 gwr #include <sys/proc.h>
48 1.1 gwr
49 1.1 gwr #include <sys/callout.h>
50 1.1 gwr #include <sys/signalvar.h>
51 1.3 ross #include <sys/resourcevar.h>
52 1.1 gwr
53 1.1 gwr #include <machine/db_machdep.h>
54 1.1 gwr
55 1.1 gwr #include <ddb/db_access.h>
56 1.1 gwr #include <ddb/db_command.h>
57 1.1 gwr #include <ddb/db_interface.h>
58 1.1 gwr #include <ddb/db_lex.h>
59 1.1 gwr #include <ddb/db_output.h>
60 1.1 gwr #include <ddb/db_sym.h>
61 1.1 gwr #include <ddb/db_extern.h>
62 1.1 gwr
63 1.1 gwr void
64 1.1 gwr db_kill_proc(addr, haddr, count, modif)
65 1.1 gwr db_expr_t addr;
66 1.1 gwr int haddr;
67 1.1 gwr db_expr_t count;
68 1.1 gwr char *modif;
69 1.1 gwr {
70 1.1 gwr struct proc *p;
71 1.1 gwr db_expr_t pid, sig;
72 1.1 gwr int t;
73 1.1 gwr
74 1.1 gwr /* What pid? */
75 1.1 gwr if (!db_expression(&pid)) {
76 1.1 gwr db_error("pid?\n");
77 1.1 gwr /*NOTREACHED*/
78 1.1 gwr }
79 1.1 gwr /* What sig? */
80 1.1 gwr t = db_read_token();
81 1.1 gwr if (t == tCOMMA) {
82 1.1 gwr if (!db_expression(&sig)) {
83 1.1 gwr db_error("sig?\n");
84 1.1 gwr /*NOTREACHED*/
85 1.1 gwr }
86 1.1 gwr } else {
87 1.1 gwr db_unread_token(t);
88 1.1 gwr sig = 15;
89 1.1 gwr }
90 1.1 gwr if (db_read_token() != tEOL) {
91 1.1 gwr db_error("?\n");
92 1.1 gwr /*NOTREACHED*/
93 1.1 gwr }
94 1.1 gwr
95 1.1 gwr p = pfind((pid_t)pid);
96 1.1 gwr if (p == NULL) {
97 1.1 gwr db_error("no such proc\n");
98 1.1 gwr /*NOTREACHED*/
99 1.1 gwr }
100 1.1 gwr psignal(p, (int)sig);
101 1.1 gwr }
102 1.1 gwr
103 1.1 gwr void
104 1.1 gwr db_show_all_procs(addr, haddr, count, modif)
105 1.1 gwr db_expr_t addr;
106 1.1 gwr int haddr;
107 1.1 gwr db_expr_t count;
108 1.1 gwr char *modif;
109 1.1 gwr {
110 1.3 ross int i;
111 1.11.2.1 nathanw
112 1.2 chuck char *mode;
113 1.11.2.1 nathanw struct proc *p, *pp, *cp;
114 1.11.2.1 nathanw struct lwp *l, *cl;
115 1.3 ross struct timeval tv[3];
116 1.5 thorpej const struct proclist_desc *pd;
117 1.1 gwr
118 1.2 chuck if (modif[0] == 0)
119 1.2 chuck modif[0] = 'n'; /* default == normal mode */
120 1.2 chuck
121 1.11.2.1 nathanw mode = strchr("mawln", modif[0]);
122 1.2 chuck if (mode == NULL || *mode == 'm') {
123 1.2 chuck db_printf("usage: show all procs [/a] [/n] [/w]\n");
124 1.2 chuck db_printf("\t/a == show process address info\n");
125 1.11.2.1 nathanw db_printf("\t/l == show LWP info\n");
126 1.2 chuck db_printf("\t/n == show normal process info [default]\n");
127 1.2 chuck db_printf("\t/w == show process wait/emul info\n");
128 1.2 chuck return;
129 1.2 chuck }
130 1.2 chuck
131 1.2 chuck switch (*mode) {
132 1.2 chuck
133 1.2 chuck case 'a':
134 1.3 ross db_printf(" PID %10s %18s %18s %18s\n",
135 1.2 chuck "COMMAND", "STRUCT PROC *", "UAREA *", "VMSPACE/VM_MAP");
136 1.2 chuck break;
137 1.11.2.1 nathanw case 'l':
138 1.11.2.1 nathanw db_printf(" PID %4s S %7s %18s %18s %-12s\n",
139 1.11.2.1 nathanw "LID", "FLAGS", "STRUCT LWP *", "UAREA *", "WAIT");
140 1.11.2.1 nathanw break;
141 1.2 chuck case 'n':
142 1.11.2.1 nathanw db_printf(" PID %8s %8s %10s S %7s %4s %16s %7s\n",
143 1.11.2.1 nathanw "PPID", "PGRP", "UID", "FLAGS", "LWPS", "COMMAND", "WAIT");
144 1.2 chuck break;
145 1.2 chuck case 'w':
146 1.3 ross db_printf(" PID %10s %8s %4s %5s %5s %-12s%s\n",
147 1.3 ross "COMMAND", "EMUL", "PRI", "UTIME", "STIME",
148 1.3 ross "WAIT-MSG", "WAIT-CHANNEL");
149 1.2 chuck break;
150 1.2 chuck }
151 1.2 chuck
152 1.6 thorpej /* XXX LOCKING XXX */
153 1.5 thorpej pd = proclists;
154 1.11.2.1 nathanw cp = curproc ? curproc->l_proc : 0;
155 1.11.2.1 nathanw cl = curproc;
156 1.5 thorpej loop:
157 1.5 thorpej for (p = LIST_FIRST(pd->pd_list); p != NULL;
158 1.5 thorpej p = LIST_NEXT(p, p_list)) {
159 1.1 gwr pp = p->p_pptr;
160 1.1 gwr if (p->p_stat) {
161 1.11.2.1 nathanw l = LIST_FIRST(&p->p_lwps);
162 1.11.2.1 nathanw db_printf("%c%-10d", " >"[cp == p], p->p_pid);
163 1.2 chuck
164 1.2 chuck switch (*mode) {
165 1.2 chuck
166 1.2 chuck case 'a':
167 1.2 chuck db_printf("%10.10s %18p %18p %18p\n",
168 1.11.2.1 nathanw p->p_comm, p, l->l_addr, p->p_vmspace);
169 1.11.2.1 nathanw break;
170 1.11.2.1 nathanw case 'l':
171 1.11.2.1 nathanw do {
172 1.11.2.1 nathanw db_printf("%c%4d %d %#7x %18p %18p %s\n",
173 1.11.2.1 nathanw " >"[cl == l], l->l_lid,
174 1.11.2.1 nathanw l->l_stat, l->l_flag, l,
175 1.11.2.1 nathanw l->l_addr,
176 1.11.2.1 nathanw (l->l_wchan && l->l_wmesg) ?
177 1.11.2.1 nathanw l->l_wmesg : "");
178 1.11.2.1 nathanw
179 1.11.2.1 nathanw l = LIST_NEXT(l, l_sibling);
180 1.11.2.1 nathanw if (l)
181 1.11.2.1 nathanw db_printf("%11s","");
182 1.11.2.1 nathanw } while (l != NULL);
183 1.2 chuck break;
184 1.2 chuck case 'n':
185 1.11.2.1 nathanw db_printf("%8d %8d %10d %d %#7x %4d %16s %7.7s\n",
186 1.2 chuck pp ? pp->p_pid : -1, p->p_pgrp->pg_id,
187 1.2 chuck p->p_cred->p_ruid, p->p_stat, p->p_flag,
188 1.11.2.1 nathanw p->p_nlwps, p->p_comm,
189 1.11.2.1 nathanw (p->p_nlwps > 1) ? "*" : (
190 1.11.2.1 nathanw (l->l_wchan && l->l_wmesg) ?
191 1.11.2.1 nathanw l->l_wmesg : ""));
192 1.2 chuck break;
193 1.2 chuck
194 1.2 chuck case 'w':
195 1.3 ross db_printf("%10s %8s %4d", p->p_comm,
196 1.11.2.1 nathanw p->p_emul->e_name,l->l_priority);
197 1.3 ross calcru(p, tv+0, tv+1, tv+2);
198 1.3 ross for(i = 0; i < 2; ++i) {
199 1.8 kleink db_printf("%4ld.%1ld",
200 1.8 kleink (long)tv[i].tv_sec,
201 1.8 kleink (long)tv[i].tv_usec/100000);
202 1.3 ross }
203 1.11.2.1 nathanw if(p->p_nlwps <= 1) {
204 1.11.2.1 nathanw if(l->l_wchan && l->l_wmesg) {
205 1.11.2.1 nathanw db_printf(" %-12s", l->l_wmesg);
206 1.11.2.1 nathanw db_printsym((db_expr_t)l->l_wchan,
207 1.9 jhawk DB_STGY_XTRN, db_printf);
208 1.11.2.1 nathanw } } else {
209 1.11.2.1 nathanw db_printf(" * ");
210 1.3 ross }
211 1.3 ross db_printf("\n");
212 1.2 chuck break;
213 1.2 chuck
214 1.1 gwr }
215 1.1 gwr }
216 1.1 gwr }
217 1.5 thorpej pd++;
218 1.5 thorpej if (pd->pd_list != NULL)
219 1.5 thorpej goto loop;
220 1.1 gwr }
221 1.1 gwr
222 1.1 gwr void
223 1.1 gwr db_show_callout(addr, haddr, count, modif)
224 1.1 gwr db_expr_t addr;
225 1.1 gwr int haddr;
226 1.1 gwr db_expr_t count;
227 1.1 gwr char *modif;
228 1.1 gwr {
229 1.10 eeh extern struct callout_queue *callwheel;
230 1.10 eeh extern int callwheelsize;
231 1.10 eeh int i;
232 1.1 gwr
233 1.11 thorpej for (i = 0; i < callwheelsize; i++) {
234 1.10 eeh struct callout_queue *bucket = &callwheel[i];
235 1.10 eeh struct callout *c = TAILQ_FIRST(bucket);
236 1.10 eeh
237 1.10 eeh if (c) db_printf("bucket %d:\n", i);
238 1.10 eeh while (c) {
239 1.10 eeh db_printf("%p: time %llx arg %p flags %x func %p: ",
240 1.11 thorpej c, (long long) c->c_time, c->c_arg,
241 1.11 thorpej c->c_flags, c->c_func);
242 1.10 eeh db_printsym((u_long)c->c_func, DB_STGY_PROC, db_printf);
243 1.10 eeh db_printf("\n");
244 1.10 eeh c = TAILQ_NEXT(c, c_link);
245 1.10 eeh }
246 1.10 eeh }
247 1.1 gwr }
248