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