/* $NetBSD: db_xxx.c,v 1.20 2003/02/04 01:21:04 thorpej Exp $ */ /* * Copyright (c) 1982, 1986, 1989, 1991, 1993 * The Regents of the University of California. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * from: kern_proc.c 8.4 (Berkeley) 1/4/94 */ /* * Miscellaneous DDB functions that are intimate (xxx) with various * data structures and functions used by the kernel (proc, callout). */ #include __KERNEL_RCSID(0, "$NetBSD: db_xxx.c,v 1.20 2003/02/04 01:21:04 thorpej Exp $"); #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include void db_kill_proc(db_expr_t addr, int haddr, db_expr_t count, char *modif) { struct proc *p; db_expr_t pid, sig; int t; /* What pid? */ if (!db_expression(&pid)) { db_error("pid?\n"); /*NOTREACHED*/ } /* What sig? */ t = db_read_token(); if (t == tCOMMA) { if (!db_expression(&sig)) { db_error("sig?\n"); /*NOTREACHED*/ } } else { db_unread_token(t); sig = 15; } if (db_read_token() != tEOL) { db_error("?\n"); /*NOTREACHED*/ } p = pfind((pid_t)pid); if (p == NULL) { db_error("no such proc\n"); /*NOTREACHED*/ } psignal(p, (int)sig); } void db_show_all_procs(db_expr_t addr, int haddr, db_expr_t count, char *modif) { int i; char *mode; struct proc *p, *pp, *cp; struct lwp *l, *cl; struct timeval tv[2]; const struct proclist_desc *pd; if (modif[0] == 0) modif[0] = 'n'; /* default == normal mode */ mode = strchr("mawln", modif[0]); if (mode == NULL || *mode == 'm') { db_printf("usage: show all procs [/a] [/n] [/w]\n"); db_printf("\t/a == show process address info\n"); db_printf("\t/l == show LWP info\n"); db_printf("\t/n == show normal process info [default]\n"); db_printf("\t/w == show process wait/emul info\n"); return; } switch (*mode) { case 'a': db_printf(" PID %10s %18s %18s %18s\n", "COMMAND", "STRUCT PROC *", "UAREA *", "VMSPACE/VM_MAP"); break; case 'l': db_printf(" PID %4s S %7s %18s %18s %-12s\n", "LID", "FLAGS", "STRUCT LWP *", "UAREA *", "WAIT"); break; case 'n': db_printf(" PID %8s %8s %10s S %7s %4s %16s %7s\n", "PPID", "PGRP", "UID", "FLAGS", "LWPS", "COMMAND", "WAIT"); break; case 'w': db_printf(" PID %10s %8s %4s %5s %5s %-12s%s\n", "COMMAND", "EMUL", "PRI", "UTIME", "STIME", "WAIT-MSG", "WAIT-CHANNEL"); break; } /* XXX LOCKING XXX */ pd = proclists; cp = curproc; cl = curlwp; for (pd = proclists; pd->pd_list != NULL; pd++) { LIST_FOREACH(p, pd->pd_list, p_list) { pp = p->p_pptr; if (p->p_stat == 0) { continue; } l = LIST_FIRST(&p->p_lwps); db_printf("%c%-10d", " >"[cp == p], p->p_pid); switch (*mode) { case 'a': db_printf("%10.10s %18p %18p %18p\n", p->p_comm, p, l != NULL ? l->l_addr : 0, p->p_vmspace); break; case 'l': while (l != NULL) { db_printf("%c%4d %d %#7x %18p %18p %s\n", " >"[cl == l], l->l_lid, l->l_stat, l->l_flag, l, l->l_addr, (l->l_wchan && l->l_wmesg) ? l->l_wmesg : ""); l = LIST_NEXT(l, l_sibling); if (l) db_printf("%11s",""); } break; case 'n': db_printf("%8d %8d %10d %d %#7x %4d %16s %7.7s\n", pp ? pp->p_pid : -1, p->p_pgrp->pg_id, p->p_cred->p_ruid, p->p_stat, p->p_flag, p->p_nlwps, p->p_comm, (p->p_nlwps != 1) ? "*" : ( (l->l_wchan && l->l_wmesg) ? l->l_wmesg : "")); break; case 'w': db_printf("%10s %8s %4d", p->p_comm, p->p_emul->e_name, (l != NULL) ? l->l_priority : -1); calcru(p, &tv[0], &tv[1], NULL); for (i = 0; i < 2; ++i) { db_printf("%4ld.%1ld", (long)tv[i].tv_sec, (long)tv[i].tv_usec/100000); } if (p->p_nlwps == 1) { if (l->l_wchan && l->l_wmesg) { db_printf(" %-12s", l->l_wmesg); db_printsym( (db_expr_t)(intptr_t)l->l_wchan, DB_STGY_XTRN, db_printf); } } else { db_printf(" * "); } db_printf("\n"); break; } } } } void db_dmesg(db_expr_t addr, int haddr, db_expr_t count, char *modif) { struct kern_msgbuf *mbp; int ch, newl, skip, i; char *p, *bufdata; mbp = msgbufp; bufdata = &mbp->msg_bufc[0]; for (newl = skip = i = 0, p = bufdata + mbp->msg_bufx; i < mbp->msg_bufs; i++, p++) { if (p == bufdata + mbp->msg_bufs) p = bufdata; ch = *p; /* Skip "\n<.*>" syslog sequences. */ if (skip) { if (ch == '>') newl = skip = 0; continue; } if (newl && ch == '<') { skip = 1; continue; } if (ch == '\0') continue; newl = ch == '\n'; db_printf("%c", ch); } if (!newl) db_printf("\n"); }